P4 (18 points): Perform the requested mathematical operations below, which use 5-bit 2's complement operands and produce a 5-bit 2's complement result. State both the value of carryout and if there is an overflow. For all cases, the carry-in bit is zero A: 00011 + 00111 C: 01100 01001 E: 11100 11101 B: 00111-00011 D: 01001 + 11011 F: 10111- 01010 P5 (7 points): As previously discussed, a Half Adder takes two inputs (X and Y) and produces two outputs (Cout and S) A: Show that the Half Adder is commutative; that is, show that swapping the inputs to the Half Adder yields the same output. B: Write an expression for the outputs of a Half Adder if precisely one of its inputs is fixed at 0. C: Showing that a Full Adder is commutative would require inspecting six possible permutations. We will simply state for now that the Full Adder is also commutative. Show that a Full Adder with one of its inputs fixed at 0 has the same functionality as a Half Adder