4. Consider a Turing machine that, at each transition, can either move its RW head to the right or leave it in place that is, it cannot move the R/W head left. Is this Turing machine variant equivalent in terms of computational power to the standard Turing machine model defined in class? If not, is it more powerful than a deterministic finite automata? In either case, explain your answer. 4. Consider a Turing machine that, at each transition, can either move its RW head to the right or leave it in place that is, it cannot move the R/W head left. Is this Turing machine variant equivalent in terms of computational power to the standard Turing machine model defined in class? If not, is it more powerful than a deterministic finite automata? In either case, explain your