Turing machine. Function implementation (A+(B≡C)) how to do?

Question

Programming

The input is A*B*C, in binary form, not necessarily of the same length. If there is no argument A, B, or C
, it is assumed to be zero. As a result of execution, only the result of the function should remain.
I understand the Turing sum, but here's how to implement equivalence, especially considering that there is a "temporarily unnecessary" element nearby.
Thanks in advance