Theory of Computation - Old Questions

4.  Write regular expression for the following regular languages.

        a) The set of strings over a alphabet {a, b} containing at least one 'a' and at least one 'b'.

        b) The set of strings over {0, 1} whose 5th symbol from right end is 1.