Regular expressions II: For each of the following languages over the alphabet $\{0,1\},$ give

a regular expression that describes that language, and briefly argue why your expression is

correct.

$($a$)$ All strings that do not contain $000$ as a subsequence.

$($b$)$ Strings in which every occurrence of the substring $00$ appears before every occurrence

of the substring $11.$