Q $1.(5$ points per item$)$ Construct deterministic finite automata $($DFAs$)$ that accept each of the

following languages. In each case, give the state diagram of the DFA fully and clearly. The alphabet

in all parts in $\{0,1\}.$

$($d$)\{w_1{w}_{2}dots{w}_n|{\displaystyle \underset{i=1}{\overset{n}{}}}{w}_i-=0$mod$2$AND${\displaystyle \underset{i=1}{\overset{n}{}}}{w}_i-=2$mod$3\}$