Given below is NFA NF A 0 (S a. a. In the context of converting this NFA to an equivalent DFA, the equivalent DFA will have 5 states: (1,2), (2,3), 1,4), (5), and , which one of them is the start state in the DFA ? 11,2 11.4) 2,3) O (5) In the context of converting this NFA to an equivalent DFA, the equivalent DFA will have 5 states: (1,2), (2,3), (1,4), 5), and . What should be the edge from {2,3} to {1,4} ? O a there is no path from (2,3) to (1,4) In the context of converting this NFA to an equivalent DFA, the equivalent DFA will have 5 states: (1,2), (2,3), 1,4), (5), and . What should be the edge from( 1,2) to {1,4} ? 0 there is no directed edge from {1,2} to {1,4) In the context of converting this NFA to an equivalent DFA, the equivalent DFA will have 5 states: (1,2), 2,3), (1,4), (5), and . What should be the edge from {5} to {1,4} ? there is no directed edge from (5) to (1,4)