(Solved): Theory Of Automata Draw a transition diagram for a three-tape TM that works as follows: Starting in ...

Draw a transition diagram for a three-tape TM that works as follows: Starting in the configuration $\left(q_0,\underline{?}x,\underline{?},\underline{?}\right)$, where $x$ and $y$ are strings of 0 's and 1 's of the same length, it halts in the configuration $\left(h_a,\underline{?}x,\underline{?}y,\underline{?}z\right)$, where $z$ is the string obtained by interpreting $x$ and $y$ as binary representations and adding them. Note: As discussed in the class, the transition function of a three-tape TM would look like $?(p,?,?,?)=\left(q,{?}_1,{?}_1,{?}_1,D_1,D_2,D_3\right)$ and would be represented by the diagram