you can either draw a transition diagram or a transition table. Use either B or t for the blank symbol.

Write a Turing machine program that changes any input w of the form $u₁ u_m#z to $u₁ u_m-1#u_mz if m 1, where u₁, . . . , u_m {a, b} and z {a, b} ; If w is of the form $#z with z {a, b} , the Turing machine does not rewrite the input. At the beginning of computation, the Turing machine is in state q₀ and its head is located on the leftmost cell (that is, the one that holds $). The computation must end in a state s, with the head located on the leftmost cell.