5. Construct the NFA (nondeterministic finite automaton) transition diagram given the following transition table. (6%) Convert the NFA to a DFA (deterministic finite automaton) using the subset construction. (4%)