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:

$0001001001100111$A$0001000100100001$AXXXXXXXXXXXXXXXXA

The final tape, when the Turing Machine stops $($enters its final state$),$ must contain:

XXXXXXXXXXXXXXXXAXXXXXXXXXXXXXXXXA$0010001110001000$A

$1$ give me the diagram of the turning machine rather than the outline for making it