Consider the following DFA (M1) over the alphabet ? = = {0,1}: 91 1 0 93 42 Grafstate Consider the following NFA (N1) over the alphabet S = {0, 1}: State diagram for an NFA 0 E, 1 92 ,1 0 91 93 4. Use the algorithm from class to convert the NFA Ni to an equivalent NFA N2 without E-transitions. 5. Use the algorithm from class to convert N2 to an equivalent DFA. You may use the modifications to the this part of the algorithm that you discovered in cw3. You may also consult the Grafstate tutorial