$4.(40$pts$,10$ each$)$ Multiply each of the following pairs of signed $2\text{'}$s$-$complement numbers using

the Booth algorithm. In each case, assume that A is the multiplicand and B is the multiplier.

Repeat the problem using bit$-$pair recording of the multiplier.

$($a$)$ A$=10011010$ and B$=01010011$

$($b$)$ A$=10011110$ and B $=10011000$