This is a Theory of Computation Problem:

Problem 2. (Turing Model Variation) (30 Points) Consider the following variation of the standard Turing machine model (as described in class). There are two tape heads which are exactly next to each-other pointing to adjacent cells. The heads move simultaneously two positions each time, either to the left or to the right. Each transition is of the fornm (z, y) (u, u), L or (z, y) (u,u), R, where symbols ano y are in adjacent cells, and replaced by symbols u and v, respectively. Prove that this model is equivalent to the standard Turing machine model. Problem 2. (Turing Model Variation) (30 Points) Consider the following variation of the standard Turing machine model (as described in class). There are two tape heads which are exactly next to each-other pointing to adjacent cells. The heads move simultaneously two positions each time, either to the left or to the right. Each transition is of the fornm (z, y) (u, u), L or (z, y) (u,u), R, where symbols ano y are in adjacent cells, and replaced by symbols u and v, respectively. Prove that this model is equivalent to the standard Turing machine model