Given is the following NFA with three states: 1, 2, and 3. Start 2 Final 3 1 In the context of converting this NFA to DFA, the resulting DFA has 3 states. O True O False QUESTION 5 Given is the following NFA with three states: 1, 2, and 3. Start 1 2 Final 3 QUESTION 6 a 2 Start 1 2 Final 3 O O In the context of converting this NFA to DFA (transition table Tp), Tp({D), a} is O. O True O False In the context of converting this NFA to DFA, the resulting DFA has the final state {1,2,3). O True O False a 2 D Given is the following NFA with three states: 1, 2, and 3. la 2 O O b O 3 O lb O 3 0 b O 3 O A 0 |0 1 JA O O 1 JA O O 1