A Turing machine with stay put instead of left is similar to an ordinary Turing machine, but the transition function has the form

δ : Q × Γ → Q × Γ × {R, S}.

At each point, the machine can move its head right or let it stay in the same position. Show that this Turing machine variant is not equivalent to the usual version. What class of languages do these machines recognize?