Illustration DFA - word length divisible by 2 or by 3

Sketch of a deterministic finite automaton (DFA) for the following regular language (type 3):$$L ~=~ \{ a^n ~:~ n \text{ is divisible by 2 or by 3 } \}$$
This is an infinite language with, for example, the following words:$$L ~=~ \{ aa, aaa, aaaaaa, aaaaaaa, ~.... \}$$