A regular language is accepted by a non-deterministic finite automaton (NFA) with states. Which of the following statement(s) is/are FALSE?
- Amay have an accepting NFA with states.
- Bmay have an accepting DFA with states.
- CThere exists a DFA with states that accepts .
- DEvery DFA that accepts has states.

