$[8$ Points$]$ Subset method. The following nondeterministic finite automaton accepts the

set of words from $\{a,b{\}}^{**}$ that end in aaa. Use the subset method from lecture $8b$ to

convert this automaton to an equivalent deterministic finite automaton. Draw a state$-$

diagram for your automaton $($showing only the reachable states$).$ In your drawing, clearly

label each state of the DFA with the set of states of the NFA that it represents.

$[10$ Points$]$ Subset method. Use the subset method from Lecture $8$b to convert the fol$-$

lowing nondeterministic finite automaton to an equivalent deterministic finite automaton

$M=(Q,,,s,F).$ Specify all five components of the automaton, writing $$ as a table.

You only need to show the reachable states. Use proper set notation to describe the states

of your DFA.