How many states are there in a minimum state deterministic finite automaton accepting the language $L = \{w \mid w \in \{0, 1\}^*, \text{number of 0's is divisible by 2 and number of 1's is divisible by 5} \}$?
- A. 7
- B. 9
- C. 10
- D. 11
Answer: C. 10
Explanation: The number of states is the product of the divisors: $2 \times 5 = 10$.