Assume that RIGHT and LEFT are replaced by DOUBLE-RIGHT and DOUBLE-LEFT in the Turing machine, its transition function now has the form: : Q Q {RR, LL}. At each point, the machine can move its head right two steps, or move its head left two steps. Is this Turing machine variant equivalent to the standard Turing machine? Namely, can any language recognized by one be recognized by the other? Prove your answer.