3. Let M = (Q, , , q0, F) be a DFA with Q = {q0, q1, q2}, = {a, b}, F = {q2} and the transition function : a) Draw the automaton M b) Make the transition table of M for the words abaa, bbbabb, bababa bbbaa c) Which of the words processed in (b) are accepted by M?

\begin{tabular}{c|c|c|} & a & b \\ \hline q0 & q0 & q1 \\ \hline q1 & q2 & q1 \\ \hline q2 & q2 & q0 \\ \hline \end{tabular}