3. [15 marks] This question tests your understanding of how to translate a finite automaton into a regular expres- sion. Consider DFA M = (Q, , , q, F) such that Q =,g2:gs), q qi, F-(a, gs), and is given by: 1 92 92 92 93 92 93 92 91 Draw the state diagram for M, an describing L(M) d then apply the construction of Lemma 1.60 to obtain a regular expression