Let k ≥ 2. Let L be the set of strings in {0,1}* such that x ε L if and only if the number of 0's in x is divisible by k and the number of 1's in x is odd. The minimum number of states in a deterministic finite automaton (DFA) that recognizes L is
A. k + 2
B. 2k
C. klogk
D. k2
E. 2k