Consider the regular expression $(0+1)(0+1)\dots N \text{ times}$. The minimum state FA that recognizes the language represented by this regular expression contains

(i) $n$ states
(ii) $(n+1)$ states
(iii) $(n+2)$ states
(iv) None of the above