Turing Machine Equivalence. A Turing Machine with doubly infinite tape is very similar tothe standard Turing Machine, except that its tape is infinite to the left and right. The tape isinitially filled with blanks except the input. Computation is identical to the standard TuringMachine except that the head will never come to an end when moving to the left. Show that this type of Turing Machine is equivalent to the standard Turing Machine. Hint: An example of proving Turing Machine equivalence can be found in the section notes.