First Q

3. A finite automaton has the initial state 20, and the other two states q 1 and 92. The transition function is 8(90, 1) - 4, 8(9, 1) = 4., 8(9,0) = 42.819, 1) = 42, 8(92,0) = 42, 8(9, 1) 42,690,0) - 9. 9. is the initial state, and q, 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 describe this set of strings in set notation. (15 pts) 4. Describe a general procedure for building a lexical analyzer. (20 pts)