Consider the following DFA (M) over the alphabet I = {0,1}: State diagram for a DFA 0 91 93 42 M Grafstate Consider the following DFA (M2) over the alphabet S = {0,1}: State diagram for a DFA 0 1 1 ri r2 r3 Grafstate 10. Modify the DFA Union algorithm from class to construct a DFA M that recognizes L(MI) n L(M2). 11. How does M differ from the DFA that the DFA Union algorithm would construct to recognize L(MI) U L(M2)