Part II: FAs and Regular Languages PROBLEM 5 Let M = be the DFA defined as follows: 2-[a, b),Q0, ql, q2, q3), F- I3). The transition function is given by this table: olq1 Iqo q2lq2 q3 q3 q2 q3 where 'd, in the table is (a) Draw the transition diagram for M (b) Trace the computations of M for the strings w defined below by computing 6(q0, ), when w is: (1) abaa (2) aaaablb (c) Which of the strings from (b) are accepted by M? (d) Describe formally L(M) as where ??? is some necessary and sufficient condition that w must satisfy in order to be in L(M)