Consider the following DFA
Minimum number of states required to construct an equivalent NFA is ?
(A) 4
(B) 5
(C) 3
(D) 6
In the above question the solution provided is that it is a DFA that accepts all the strings containing at most two 1’s.. When we have not been provided any information about any state being final or initial state, how are we supposed to proceed ??