Question 2: Consider the regular expression (01*01)* 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 Myhill-Nerode method, i.e. the methood we used in class Part d: Apply the algebraic method that solves systems of regular expressions to obtain a regular expression corresponding to your minimized DFA obtained in Part (c)