For this question, we consider what would happen if we changed what types of transitions were allowed for a Turing machine. In particular, let's consider what would change if instead of going left or right on the tape head in each transition, the Turing machine was instead allowed to go right or stay still (but not allowed to go left on the tape). Call this type of machine an ODTM. What would the set of languages you can build an ODTM to decide be - would it be the set of regular languages, the set of context-free languages, or the set of decidable languages (the same as normal Turing machines)? Justify your answer by explaining how to convert any ODTM to an NFA if you chose regular, a PDA if you chose context-free, or a normal Turing machine if you chose decidable