Design Turing machines with states and transitions for doing the following
jobs:
(a) Addition of two natural numbers.
(b) Given a string of a’s, it leaves a blank to the right of the given string and then
copies the string.
(c) Given two strings of a’s with a blank in between, it outputs 1 if first string is of
length at least that of the second; else, it outputs 0.
(d) Given a string w ∈ {0, 1}+ as input, it outputs wR.