B . A E C D 0 1 2. Use subset construction to convert the NFA given in problem 1 to an equivalent DFA. Each DFA state should be named with a number of NFA state names in alphabetical sequence. If the empty-set state is necessary, name it {}. The alphabet of the NFA is the set {0, 1}. Show the transition function of the resultant DFA as a table and clearly specify the start state and the set of final states of the resultant DFA