Give regular expressions for the following languages over the alphabet {a,b}, and justify your answer:

A. The set of all strings where all occurrences of the substring aa occur before any occurrences of the substring bb.

B. The set of all strings with at most one occurrence of the substring aa and at most one occurrence of the substring bb.

For example: b*a*(a+b)*