A Turing machine with left reset is similar to an ordinary Turing machine, but the transition function has the form
$$\delta: Q\times \Gamma \rightarrow Q\times \Gamma \times \{R,RESET\}$$
If $\delta(q, a) = (r, b, RESET),$ when the machine is in state $q$ reading an $a,$ the machine’s head jumps to the left-hand end of the tape after it writes $b$ on the tape and enters state $r$. Note that these machines do not have the usual ability to move the head one symbol left. Show that Turing machines with left reset recognize the class of Turing-recognizable languages.