fill in all the 2a-3f with those options

Consider the given NFA and its corresponding DFA (transition table) generated by applying the subset construction algorithm discussed in the class. No further reduction of the DFA has been performed. Fill in the blanks (i.e. cells labeled with 2a, 2b, 2F, 3a, 3b, 3F) by matching answers. 1 a a 3 3 a ba NFA a b 2 2 DFA (transition table) Index State a b Final? 1 {0} {1,2} Err Yes 2 {1,2} 2a 2b 2F 3 {1,3}] [Choose ] {1,2} {2,3) 0 {0,3) {0,2} Yes {1,2,3) Err No {0,1} {1,3) {0,1,2] [Choose ] 2a