Consider the following DFA (M) over the alphabet S = {0,1}: State diagram for a DFA 1 0 1 90 91 Grafstate Consider the following DFA (M2) over the alphabet S = {0,1}: State diagram for a DFA 1,0 1,0 0,1 1,0 ro ri r2 r3 Grafstate 6. Write a DFA that recognizes the language L(Mi) U L(M2) using the union algorithm from class. an 9. Modify L(M1) U L(M2) to produce states. equivalent DFA that does not have any useless