Q 35,paper 3,j 12. Consider the regular expression (a + b) (a + b) ... (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

Options (A) n states (B) n + 1 states (C) n + 2 states (D) 2nstates .
Answer (B) n+1 states.