Exercise 3.2.1: Here is a transition table for a DFA: *332 * a) Give all the regular expressions ns R). Note: Think of state oi as if it were the state with integer number i * b) Give all the regular expressions . Try to simplify the expressions as much as possible c) Give all the regular expressions R. Try to simplify the expressions as nuch as possible. d) Give a regular expression for the language of the automaton. * e) Construct the transition diagram for the DFA and give a regular expres sion for its language by eliminating state q2 Exercise 3.2.2: Repeat Exercise 3.2.1 for the following DFA Note that solutions to parts (a), (b) and (e) are not available for this exercise