A Turing machine is now broken. Now the head moves to right at each time-step regardless of what the instruction set actually tells it to do (i.e., it interprets both left and right as going right). The broken Turing machine operates again on a tape with a single non-blank cell that is 0. Is the question will the head ever transition to a halt state? now computable? Explain why.