Theory of Computation - Old Questions

3.  Give the regular expression for the following languages.

        a. L={SS ∈ {a, b}* and S starts with aa or b and does not contains substring bb.

        b. L={S|S ∈ {0, 1}* and 0 occurs in pairs if any and ends with 1.