Uses = {0,1} as the alphabet.

Problem 2 (30% total. Subset construction) Let N be the NFA given in Figure 1. Apply the subset construction to convert N to an equivalent DFA. Your answer to each part of this question should provide a finite state diagram where all the states, the start state, all the accepting states and all the transitions (with the corresponding labels) are displayed/drawn clearly. 0 02 ) ( 3 DI Figure 1: The NFA N