You are to describe a Turing machine that can add two binary numbers. More exactly, You are given a multi-tape Turing machine. In the start configuration, the two binary numbers n1 and n2 are on tape 1, separated by a #-symbol: n1#n2. No other tape content is initially given (That is besides n1#n2 the multi-tape Turing machine contains only blanks). The final configuration of the Turing machine must contain n1 + n2 on tape 1 while all other tapes are blank.

2) Give a state diagram for the Turing machine described in 1), and describe your state diagram carefully.