Theory of Computation - Old Questions

6.  Give the regular expressions for following language over alphabet {0, 1}.    (2.5+2.5)

        a. Set of all strings with 2^nd symbol from right is 1.

        b. Set of all strings starting with 00 or 11 and ending with 10 or 01.