please show work

3. Write each of these two's complement numbers using hexadecimal notation, without changing its value. Use the minimum number of hex digits required for each number. (Don't forget the "x" in front of the hex number.) 10100011 00110101 100000000 1011100100100110100 4. For each of the following addition problems, the numbers are in two's complement binary representation. Compute the sum and tell whether overflow occurs or not. (Circle "yes" or "no") 01000101 + 11011111 Overflow? YES NO Carryout? YES NO 110000 # 101001 Overflow? YES NO Carryout? YES NO 011100011 110120 Overflow? YES NO Carryout? YES NO Overflow? YES NO Carryout? YES NO + 001110001 + 11111