Follow the construction from the proof of Lemma 1.60 (given any DFA, we can determine a regular expression that describes the language of the DFA) to generate a regular expression for the DFA M-((go,Y1},{a, b), , go, 140}) where (qi, a-go and (qi, b)-Y1, for i {0, 1} (a) Draw the initial corresponding GNFA (b) Draw a corresponding GNFA after removing one state. (c) Give the final regular expression As in Sipser's Example 1.66, you do not have to draw GNFA arrows labeled 0, even though they are present. You may also simplify the regular expressions on the transi tions