3. A finite automaton has the initial and finite state g0, and the other two states ql and q2. The transitionfu cit n s @n I)-q, , &q, l)-Qo, (q, )-9-6(9-0) q2, a (ga 1) q Ma, go is the initial state, and qa is the final state. Draw a transition diagram for this finite automaton. Create a regular expression to denote the set of strings accepted by this finite automaton. Also p. describe this set of strings in set notation. (15 pts) 4. Describe a general procedure for building a lexical analyzer. (10 pts)