91 93 92 Grafstate Consider the following NFA (N1) over the alphabet = {0,1}: State diagram for an NFA 0 E,1 42 ,1 0 91 93 Grafstate 4. Use the algorithm from class to convert the NFA Ni to an equivalent NFA N2 without -transitions. 5. Use the algorithm from class to convert N2 to an equivalent DFA