Consider the DFA M shown in Figure 1. 1. Convert the DFA M into an equivalent Generalized Nondeterministic Finite Automata (GNFA). 2. Remove state q3 using the method described in class to make a GNFA with one fewer state. Draw the new state diagram. 3. Remove state q2 using the method described in class to make a GNFA with one fewer state. Draw the new state diagram. 4. Give the regular expression for the language recognized by the DFA M. Ideally, give the regular expression that one gets from running the algorithm given in class and in the book after removing states 93, 92, and q in that order. 91 1 0 1 93 92 1 0 0 Figure 1: Figure depicting the DFA M for Problem 2. Activ Go to