Ndfa To Dfa Conversion

Step 1: Understanding NDFA to DFA conversion.
In the conversion from a Non-deterministic Finite Automaton (NDFA) to a Deterministic Finite Automaton (DFA), the number of states in the DFA is determined by the power set of the states of the NDFA. For an NDFA with states, the DFA may have up to states because each state of the DFA corresponds to a subset of states of the NDFA.

Step 2: Conclusion.
Therefore, the possible number of states in the equivalent DFA is , making the correct answer (3).