1. (10 points) Consider the DFAs M1 (on the left) and M2 (on the right): q1 40 42 (a) If we use the general constructions discussed in class and in the book for building a DFA whose language is L(M) U L(M2) (b) Draw the state diagram that results from this construction and remove any unreachable states. How (c) Describe the language L(Mi) UL(M2) in set builder notation. You may find it useful to first describe (d) Use the description from (c) to draw a DFA with fewer states even than what you saw in part (b). how many states would be in this DFA? Briefly justify your calculation many states are left? L(M) and L(M2) in set builder notation first. Draw the state diagram in JFLAP and include the image in your submission Note: For parts (b) and (d), you can use the "test equivalence" feature of JFLAP to check your work. 1. (10 points) Consider the DFAs M1 (on the left) and M2 (on the right): q1 40 42 (a) If we use the general constructions discussed in class and in the book for building a DFA whose language is L(M) U L(M2) (b) Draw the state diagram that results from this construction and remove any unreachable states. How (c) Describe the language L(Mi) UL(M2) in set builder notation. You may find it useful to first describe (d) Use the description from (c) to draw a DFA with fewer states even than what you saw in part (b). how many states would be in this DFA? Briefly justify your calculation many states are left? L(M) and L(M2) in set builder notation first. Draw the state diagram in JFLAP and include the image in your submission Note: For parts (b) and (d), you can use the "test equivalence" feature of JFLAP to check your work