$9\mathrm{.}9[$E$]$ 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.

$($a$)A=010111$ and $B=110110$

$($b$)A=110011$ and $B=101100$

$($c$)A=001111$ and $B=001111$

$9\mathrm{.}10[$M$]$ Repeat Problem $9\mathrm{.}9$ using bit$-$pair recoding of the multiplier.

Please show all work and do just $9\mathrm{.}10$ please