3. Let M1 be the FSA accepting the language described in part b of the previous question. Let M2 be the FSA accepting the language described in part c. Draw FSA's for the following languages:

a. The union of the two languages accepted in parts b and c.

b. The intersection of the two languages from parts b and c.

The previous question to use as a resource for this answer:

2. For each part below, draw an FSA accepting the indicated language where the alphabet is (a,b):

a. The language of all strings containing exactly two a's.

b. The language of all strings containing at least two b's.

c. The language of all strings that do not end with ab.