1. Convert the following NFA into an equivalent DFA using the method that generates only states actually needed. 0 a 1 0,1 0 0, 1 0, 1 a. Calculate the transition function for the deterministic automaton, adding rows in the transition function if necessary. Don't forget to indicate which states are final. Final State? State 0 1 b. Give a graphical depiction of the equivalent deterministic finite state automaton.