5. Perform the following arithmetic operations using 8 bit 2's complement representation. Show the base 10 numbers for each to verify. For each operation indicate whether or not overflow occurs. a) 01100100+00110010 b) 01100100+11001110 c) 11001110+11001110 d) 10011100+10011100 6. Is the following code segment an infinite loop? why/why not? Assume the int values are stored using 2's complement notation. You may want to test this with Java inti 1; while (i> 0) ( System.out.println(); 7. Given the unsigned number 23 in 8-bit binary, show the resulting bit representation and base 10 values after the shift left and shift right operations. Given the signed number-23 in 8-bit two's complement, show the resulting bit representation and base 10 values after the shift left and shift right operations