$.$ Show the step$-$by$-$step multiplication process using Booth algorithm when the following binary

numbers are multiplied. Assume $5-$bit registers that hold signed numbers. The multiplicand in both

cases is $+18.$ a$.(+18)$ x $(+13)$ b$.(+18)$ X $(-13)$