Draw a transition diagram for a Turing machine that decides the language $\{1$n#b : b is the

binary representation of n$\}.($For example, $11111$#$101$ is in the language, but $111$#$110$ is

not.$)$ Give a brief explanation of your design.