4. (a) Convert the NFA shown in Fig. 1 to a language-equivalent DFA following the "set of all subsets" construction discussed in class. Show the stages of the procedure in detail, as well as the final result. Give all of the ingredients in the formal definition of the DFA (a diagram suffices for the state transition function). start 0,1 A 0 B 1 C Figure 1: An NFA. (b) Are there any unreachable states in the resulting DFA? Explain. Draw the reduced DFA without unreachable states if there are any.