Consider the regular expression (0+1)(0+1)...(0+1), where (0+1) is repeated n…

Consider the regular expression (0+1)(0+1)...(0+1), where (0+1) is repeated n times. The minimum-state finite automaton that recognizes the language represented by this regular expression contains: