Question 4. Below is a transition diagram for an NFA N. The ultimate goal of this question is to obtain the minimal DFA accepting the language of N. Follow the instructions in steps outlined below. a a 5 E b b a E b b 2 4 6 (4.a) Write down the formal description of N. (4.b) Write down the E-closure of each state of N. Then eliminate all e-transitions from N. Draw a transition diagram for the result. (4.c) Perform the subset construction on the automaton you got as a result in part b) and draw a transition diagram for the resulting DFA. You only need to draw reachable subsets. 2 (4.d) Minimize the DFA you obtained in part c). Draw a transition diagram for the minimal DFA. Show all your work. Hint for Question 4: The DFA you get as the final result in (4.d) should have five states. If you end up with a DFA with fewer or more than 5 states, you probably made an error somewhere on the way. Double check your work