Please draw the Turing machine. $2.$ Design a Turing Machine that given two $16-$bit binary numbers written on the tape, delimited by A$,$ computes the sum of both numbers. For example, if the tape initially contains: $\backslash (0001001001100111$ A $0001000100100001$ A X X X X X X X X X X X X X X X X A $\backslash )$ The final tape, when the Turing Machine stops $($enters its final state$),$ must contain: XXXXXXXXXXXXXXXXXAXXXXXXXXXXXXXXXXA$0010001110001000$A