Machine $05,$ Please give correct Table of the code. Please run on your computer first and then write it here. THis is my $4$th attempt and I get the wrong answer.

Construct a Turing machine to do the following: Assume the machine is started on a tape that contains only a continuous $($ie$,$ not broken by spaces$)$ string of characters. The only allowable characters on the string are A$,$ C$,$ G$,$ T or empty space $(\_).$ The machine is started on the left of the string. The purpose of the machine is to reverse the string of characters. For instance, if the input string is CAT, the machine should write TAC and halt.

Initial Input: ACATAG