6. (0.5 bonus points) A Turing machine that cannot move left by one symbol and instead does a RESET all the way to the beginning of the tape has a transition function like 8. Q x Q x x(R, RESET), where RESET moves the read head to the far-left edge Show that these machines ARE NOT less powerful than ordinary Turing machines, i.e., they are still capable of recognizing the class of Turing-recognizable languages. Let me help you get started: Everything else is the same about these machines except we don't have the ability to move left directly, but we can easily simulate that operation by doing[you complete]