$(5$ points$)$ A Turing Machine with stay put instead of left is similar to the Standard

Turing Machine, but the transition function has the form

$$:$QlongrightarrowQ\{R,S\}.$

At each point, the machine can move its head right or let it stay in the same position.

List the class of languages that these machines recognize? Based on your answer, does

this Turing Machine have the same equivalent power of the Standard Turing Machine?

Note: You only have to consider the languages we have covered in this course. Check

out the notes.