Define a stay$-$or$-$right Turing machine to be a single$-$tape deterministic Turing machine with : Q $$ Q $\{$R$,$ S$\},$ i$.$e$.,$ at each step of computation, the tape head can either stay at its current position or move once to the right, but it can never move to the left. Prove that stay$-$or$-$right Turing machines are not equivalent to standard Turing machines. Hint. Does it seem like stay$-$or$-$right Turing machines are more or less powerful than standard Turing machines? If they seem more powerful, can you identify a language that a stay$-$or$-$right Turing machine can recognize that is not Turing$-$recognizable? If they seem weaker, could you equate the power of a stay$-$or$-$right Turing machine to another computational model we$$ve seen in the course?