Create a deterministic Turing machine to compute the reverse of a string

$\backslash$Sigma $=\{$a$,$b$\}$

When simulating your Turing machine on the input string abb, the output should be bba. You can use one tape or multiple tapes. However, the input string does not have blanks before it

$($Example: abb is input, but there is no $\_()$abb$)$

as there is a "wall" before the input string.

I've asked this question before however the answer was incomplete and needed to look at the simulation again.

It seems like it failed to put the an $"$a$"$ down in step $2$ of the problem in which "Xbba "didnt happen but instead $"$Xbb$".$ How could I solve this problem?