$3.$ Consider the Booth$$s algorithm for $2$s complement number multiplication.

$($a$)$ Show Booth$$s recoded number for binary value $(1010011101)$ and justify your answer.

$($b$)$ For $(1010*0101),$ i$.$e$.,(-6)*5$ in decimal, show the contents of registers for each step.

MD AC MQ MQ $-1$

$............$

$4.$ Perform the restoring division for $(1011/0100),$ i$.$e$.,11/4$ in decimal, and show the contents

of registers for each step. Also show the resulting quotient and remainder in binary numbers.

MD AC MQ

$............$

$5.$ Perform the non$-$restoring division for $(1011/0100),$ i$.$e$.,11/4$ in decimal, and show the contents

of registers for each step. Also show the resulting quotient and remainder in binary numbers.

MD AC MQ

$............$

$6.$ Explain briefly how the non$-$restoring division algorithm achieves higher efficiency

than the restoring division algorithm.