This is the solution of problem 3.

Please answer the problem 4 based on the solution of problem3.

3. (6 points) Using the McNaughton-Yamada-Thompson Algorithm, construct an NFA from the regular expression (-(0,1): 0((01)*1) 1 a) Draw a state graph for the NFA b) Construct the state transition table for the NFA taking into consideration e-closures (up to Step 3 of alogrithm on slides). 3. 2.9 7 4. (12 points) Convert the above NFA to a DFA a) Construct the state transtion table for the DFA, starting from the start state. b) Draw the state graph for the DFA c) If necessary, minimize the state graph for the DFA