P1 (8 points): Express -5810 in the following binary formats. If it is not possible simply write Not Possible. Indicate how many bits are needed. a. Unsigned b. Sign & Magnitude c. 1's Compliment d. 2's Compliment P2 (12 points): Perform the following operations on the numbers and indicate if overflow occurs for each operation. All numbers are 6 bits wide (stored in 2's complement). Show your work and all carry bits. + 110010 010100 100101 110011 + 001011 011001 - 011110 001100 + 101100 011110 101011 010111 P3 (10 points) Draw the complete circuit diagram for a 3-bit ripple-carry adder. You are allowed to use 2-input and 3-input logical gates (of any type), but you can't use any higher-level abstractions (e.g., can't use half- adders or full-adders). P4 (10 Points): You are given a 4-bit adder as a black box (say a microchip that you can't modify). The adder is too small for what you need to do and also does not compute an overflow bit. Draw a circuit that uses the 4-bit adder and any additional elements that you think are necessary to implement a 6-bit ripple-carry adder that also computes an overflow bit. Label all inputs, outputs and components.