plz provide the correct solution thankss

Q9. [10 pts] Let L be some regular language in which all the words happen to have an even length. Let us define the new language Twist (L) to be the set of all the words of L twisted, where by twisted we mean the first and second letters have been interchanged, and so on. For example, if L={baabbababb......}Twist(L)={abbaababbb......} Build a Turing Machine that accepts Twist(L). You are also allowed to use the sub programs of INSERT and DELETE. You may assume after INSERT operation, tape head points at the newly added cell while after DELETE operation, tape head points at the same location. You may leave the tape head at any location on the output string when the computation is done. Status of tape on input is: Status of tape at the output is