Theory of Computation - Old Questions

4.  Give the regular expression for the following languages over alphabet {a, b}

        a. Set of all strings ending with substring ab.

        b. Set of all strings with 2^nd and 4^th symbol is b.