Problem 4. Convert this DFA to a regular expression following Lemma 1.60. Answer each step separately. (12) a) First, convert the DFA to a GNFA. Enter the result in JFLAP and show the image here. Empty set transitions can be omitted. b) Second, rip state q1 from the GNFA and show the JFLAP image of the resulting GNFA. c) Show the final regular expression resulting from the full conversion