Show how to modify the adder circuit in the text to replace the carry out output with an overflow output that is 0 if the carry in to the leftmost bit position is equal to the carry out of that...

Show how to modify the adder circuit in the text to replace the carry out output with an overflow output that is 0 if the carry in to the leftmost bit position is equal to the carry out of that position, and is 1 if they are different. Prove that, with this modification, the adder works properly for n-bit two’s-complement numbers.