A $2\text{'}$s complement binary adder circuit adds two integers whose most

significant bits $($MSBs$)$ are A and $B.$ The MSB of the sum produced by the

adder is $C.$

a$)$ Write a truth table for a Boolean variable $Z$ such that $Z=1$ only when an

overflow has occurred.

b$)$ Express $Z$ in canonical SOP form. Make it really easy for $me$ to find your

answer.

c$)$ If the inputs to the overflow detector are taken in the order $A,B,C,$ express $Z$

in product of maxterms form, for example, like so $($note that the product of

maxterms given below may or may not be correct$)$:

$Z=$prodM$(5,6,7).$