5. In Problem 1, we have proven that a Turing Machine with doubly infinite tape has equivalent ine with doubly infinite ta M, consider the following language L RIGHT- ((M), r) M moves its head to the right at least once during its execution on input r. Is this language decidable? If so, describe a Turing Machine that decides this language. If not, give a proof. 1. A Turing Machine with doubly infinite tape is very similar to the standard Turing Machine, except that its tape is infinite to left and right. The tape is initially filled with blanks except the input. Computation is identical to the standard Turing Machine except that the head will never come to an end when moving to the left. Also, the head can start at any place of the input r. Show that this type of Turing Machine is equivalent to the standard Turing Machine. Hint: An erample of proving Turing Machine equivalence can be found in the section notes 5. In Problem 1, we have proven that a Turing Machine with doubly infinite tape has equivalent ine with doubly infinite ta M, consider the following language L RIGHT- ((M), r) M moves its head to the right at least once during its execution on input r. Is this language decidable? If so, describe a Turing Machine that decides this language. If not, give a proof. 1. A Turing Machine with doubly infinite tape is very similar to the standard Turing Machine, except that its tape is infinite to left and right. The tape is initially filled with blanks except the input. Computation is identical to the standard Turing Machine except that the head will never come to an end when moving to the left. Also, the head can start at any place of the input r. Show that this type of Turing Machine is equivalent to the standard Turing Machine. Hint: An erample of proving Turing Machine equivalence can be found in the section notes