$(20$ pts$)$ Carry out the step$-$by$-$step procedure of Booth algorithm in multiplying

the two $7-$bit $2$s$-$complement numbers: multiplicand $($A$)$: $1011011,$ multiplier $($B$)$:

$1010011.$ Verify your result and also confirm the correctness of all intermediate

results against the $$partial multiplier$$ used so far. Also give a snapshot of the

two registers$$ value for each cycle after the shift operation is performed.

$2.(10$ pts$)$ Use a one$-$step process to add up all partial products for problem $1.$

$($specifcally question #$2)$