* a) Give all the regular expressions R. Note: Think of state qi as if it were the state with integer number i. * b) Give all the regular expressions R. Try to simplify the expressions as much as possible. c) Give all the regular expressions R. Try to simplify the expressions as much 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 g. Exercis 3.2.2) Repeat Exercise 3.2.1 for the following DFA: 2 42 1 9 93 92 9 * a) Give all the regular expressions R. Note: Think of state qi as if it were the state with integer number i. * b) Give all the regular expressions R. Try to simplify the expressions as much as possible. c) Give all the regular expressions R. Try to simplify the expressions as much 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 g. Exercis 3.2.2) Repeat Exercise 3.2.1 for the following DFA: 2 42 1 9 93 92 9