Design a multi tape turing machine that computes the sum of a binary number and 1. For example 11+1 = 100 and 101+1 =110. We know that the decimal numbers 0,1,2,3,4,5 and 6 have their binary representations 0,1,10,11,100,101,110 respectively. The input is a binary number b and the output is b+1 in binary format

a) Briefly describe how your Turing machine works with diagram of tapes

b) Draw the state diagram in a graph