Give a complete 4-tuple description of a Turing Machine that performs the computation of addition of two non-negative integers (represented in unary); the two input integers are initially written on the tape, separated by the blank symbol B. For example, the following shows the tape contents in computing the addition of 2 and 3.

Initial tape contents: ...B111B1111B... final tape contents: ...B111111B...

Design the TM with the smallest number of states and the smallest tape alphabet possible.