3.7. Find a regular expression corresponding to each of the following subsets of la, bl a. The language of all strings containing exactly two a's b. The language of all strings containing at least two a's c. The language of all strings that do not end with ab. d. The language of all strings that begin or end with aa or bb