Show that the language A over $\backslash$Sigma $=\{$a;b$\}$ is regular by constructing $($drawing$)$ a deterministic finite automaton M with L$($M$)=$ A$.$

A $=\{$w : the number of a$\text{'}$s in w is divisible by $2$ and the number of b$\text{'}$s in w is divisible by $1\}$

Hint: Think about whether $0$ is divisible by $2($divisible by $3).$