Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?

Given an arbitrary non-deterministic finite automaton (NFA) with N sta

1.	Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?
A.	N<sup>2</sup>
B.	2<sup>N</sup>
C.	2N
D.	N!
Answer» D. N!