course is theory of computation Design full$-$fledged $($all state$-$transitions$)$ decider TMs for each of the following: $1.$ The machine multiplies a binary number by $2.$ That is$,$ give a binary number $\text{'}$ n $\text{'}$ written on the tape of the TM$,$ the machine, once done, should leave $2\backslash$times xn on the tape. $2.$ The machine shifts entire input one block to the right of the tape.