1. Create a mapping Turing machine to compute the function F(x,y) = x+y, where x and y are binary numbers with the same number of bits. Assume that the input values x and y are separated by the # symbol. The command :sim M1 10#10 should produce the value 100. Make a table of input values and corresponding out values. 2. Create a mapping Turing machine to compute the function f(n) = n+1, where n is a binary number.