I need help with a-e using the table from 3.2.2

a) Give all the regular expressions RO. Note: Think of state q; 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 92. Exercise 3.2.2: Repeat Exercise 3.2.1 for the following DFA: o 1 91 92 93 92 *93 91 92 43 91