For Question one, it is asking for the four conversions of decimal numbers 88 and -117 into binary moreover; Signed magnitude, One's Complement, Two's Complement, and Excess 127.

Question 2 is to perform the loop of Booth's Algorithm of 2's complement Multiplication to completion with 10101100 as the multiplier and 11011000 as the multiplicand.

Question 3 is to perform Nonrestoring Algorithm of 2's complement Division of binary 11001101 as the divisor and 0000110000000001 as the dividend.

1. Integer representation (5.0 points): Convert these four numbers into each of the four representations. 88-117 2. 2's Complement Multiplication [Booth's Algorithm] (10.0 points): Perform the following calculation. Multiplier Multiplicand 10101100 11011000 2's Complement Division Nonrestoring Algorithm] (10.0 points): Perform the following calculation Divisor Dividend 11001101 0000110000000001 1. Integer representation (5.0 points): Convert these four numbers into each of the four representations. 88-117 2. 2's Complement Multiplication [Booth's Algorithm] (10.0 points): Perform the following calculation. Multiplier Multiplicand 10101100 11011000 2's Complement Division Nonrestoring Algorithm] (10.0 points): Perform the following calculation Divisor Dividend 11001101 0000110000000001