* a) Give all the regular expressions R Note: Think of state q, as if it were the state with integer number i. * b) Give all the regular expressions Ri. 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 q2 Exercis(3.3.2)Repea. Exercise 3.2 10th Exercise 3.2.2 Repeat Exercise 3.2.1 for the following DFA 92 1 93 *93 92 gi