3. For the following problems, the machines for problems one and two should be refered to as M, and M2, and the languages they accept as L, and L2. (12 pts) a. Give the state diagram for the DFA that accepts strings that are members of both L, and L2 b. Give the state diagram for the DFA that accepts strings that are in neither L1 or L2. 4. For = {a, b), let A = {ayar 1 x 1 and y e). Create a DFA that accepts this language. (5 pts) 5. Create a general model for making a DFA , where Mn accepts (w w contains the substring 10 n number of times). (10 pts) 6. Make NFAs for the following languages with the specified number states. (12 pts) a. The language of problem 4 with 3 states. b. The language (10U 110)* with 3 states. c. The language *110y with 5 states. 7. Convert the following NFAs to DFAs using the procedures discussed in class and in section 1.2 (name each state as a combination of states). You may exclude states with no transitions into them. (18 pts) 0 qo a