only need answer for problem 2

Problem 1. Give an implementation-level description of a Turing machine M that decides the guage B = {0"1"2"In 20), i.e Problem 2. Suppose that instead of being able to move left or right, a Turing machine is only allowed to stay put or move right. Show that such a machine can only recognize regular languages