Theory of Computation - Old Questions

2. Find the regular expression describing following languages over alphabet {0, 1}*.

        a) The language all strings containing at least two 0's.

        b) The language of all strings containing both 00 and 010 as substring.