How manystates are there in a minimum state deterministic finite automaton accepting the language $$L = \left\{w \mid w \in (0, 1)^*\right\}$$, {number of 0’s is divisible by 2 and numberof 1's is divisible by 5, respectively} ?

A

7

B

9

C

10

D

11