Perform the following binary multiplications using Booth's algorithm, assuming signed two's complement integers: 1011 1. a)X 0101 в) Х 0101 0011 2. b)X1011 1011 3. c)X 1100

Given this place-weighting, or Horner's Algorithm, convert the following eight-bit two's complement binary numbers, i.e. signed arithmetic, into decimal form: (show work) I a. 010101012 c. 11000000₂ e. 01010101₂ b. 01110010₂ 110101112 f. 011001012

Perform the following binary sums:a) 1101+1010b) 10111+01101Perform the following binary subtractions:a)1101-0100b)1001-0111

Express the following base 10 numbers in two’s complement binary fixed-point numbers with eight integer bits and eight fraction bits. Express your answer in hexadecimal. (Note: You should show all steps) −30.75 16.375