On paper, draw the state diagram of a finite automaton that accepts the language all strings over $\{0,1,2,3,4,5,6,7,8,9\}$ that represent decimal numbers divisible by $3.$ Leading $0\text{'}$s are allowed and the empty string should also be accepted. Your finite automaton should not be overly complicated.