Construct a finite automaton for the following language.

L = {w {a, b} : n_a(w) is divisible by 3 and not divisible by 6}