2. Let M be the deterministic finite automaton Q- 14o, q1, 92) ? (a, b} F (gol 40 91 91 1 2 42 4o a) Give the state diagram of M b) Trace the computation of M that processes babaab. c) Give a regular expression for L(M). d) Give a regular expression for the language accepted if both go and q1 are accepting states