Theory of Computation - Old Questions

3.  Find the regular expression corresponding to the following languages over {0, 1}^*.

a)       The language of all strings containing exactly two 0's.

b)       The language of all strings containing 00 or 101 as substrings.