a$(5$ marks$)$ For the following language, draw the state diagram of a deterministic finite automaton

that accepts the language.

$L=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{0,& 1{\}}^{**}|n_0(w)\end{array}$ is not a multiple of $5$