Question 2: Consider the regular expression (01*0+1) Part a: Give a nondeterministic finite automaton with e-transitions that corresponds to the regular expression give above. You must use the Hopcroft & Ullman procedure Part b: Convert your NFA in Part (a) to a DFA using the subset construction. Part c: Minimize your DFA in Part (b) using the algebraic method. Question 2: Consider the regular expression (01*0+1) Part a: Give a nondeterministic finite automaton with e-transitions that corresponds to the regular expression give above. You must use the Hopcroft & Ullman procedure Part b: Convert your NFA in Part (a) to a DFA using the subset construction. Part c: Minimize your DFA in Part (b) using the algebraic method