Give a detailed description $($i$.$e$.$ a state$-$machine diagram$)$ of a deterministic one$-$tape Turing machine which decides the language $\{0$n$1$n$0$n$1$n : n $>=0\}.$ For example, $000111000111$ is in this language.