Lemma 1.60: If a language is regular, then it is described by a regular expression.

2. (15 points) Use the rules of the proof of Lemma 1.60 (or the method we used in class) to convert the following FA into a regular expression. Remove states in numerical order and show all your intermediate steps for full credit.) g0 q1 92