Create a transition table for the following NFAConsider the following NFA:

$($a$)[8$ marks$]$ Create a DFA that recognizes the same language as the above NFA by using the

subset construction approach. Your answer may be either the DFA itself or just the transition

table. Note that the sample solution has $13$ total states. You can check your answer by finding

the Regular Expression for this NFA and then testing it in the automata simulator.

$($b$)[7$ marks$]$ Minimize the DFA that you created in $4$a$.$ Note that the sample solution has $8$ total

states.