3. Use subset construction to convert the NFA shown below to an equivalent DFA. Each DFA state should be named with a number of NFA state names in numerical sequence. If the empty-set state is necessary, name it {}. The alphabet of the NFA is the set {a, b}. 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. a, b 3 E E 4 3 6 a, b