Create a Turing machine $($draw the full state transition diagram$)$ that accepts all strings over $=\{0,1\}($i$.$e$.,$ binary strings$)$ such that the total number of $0$s $($n$0)$ and the total number of $1$s $($n$1)$ sum to $3$k $($i$.$e$.,$ n$0+$ n$1=3$k$)$ for some non$-$negative integer k$,$ and rejects every other string. For example, the string $011$ is accepted, but $11$ is rejected. Assume the tape alphabet is $\{0,1,\}.$