Please show all steps to the solution.

Give regular expressions (using = {a, b, , following subsets of fa, bl* A. and the operators ) for the E- (w contains at least two a's and at most one bh Use the procedure described in Lemma 1.55 (If a language is described by a regular expression, then it is regular.) to construct NFAs that accept the sets of strings matching the following regular expressions. = {0, 1). B. a. (000 u 11*)* b. (000)1(00)1 For = {a, b, construct NFAs that accept the set of strings matching the following regular expressions. You do not need to use the method in Lemma 1.55 C. b. (ab)* u(aub(ab*a)*b)