Construct a Turing machine to implement each function. The inputs are pairs of natural numbers represented as unary strings and separated by the symbol #. Where necessary, represent zero by the tape symbol A.a. Add two natural numbers, neither of which is zero.b. Add two natural numbers, either of which may be zero.