Booth$$s algorithm to find the product of a multiplier, M$,$ and a multiplicand,

B$,$ can be summarized by the following table:

Cin Multiplier LSL # ALU Cout

$0002-$ A$+00$

$00122$N A$+$B $0$

$0102(2$N$+1)$ A$+$B $0$

$01122$N A$$B $1$

$10022$N A$+$B $0$

$1012(2$N$+1)$ A$+$B $0$

$11022$N A$$B $1$

$1112-$ A$+01$

Demonstrate how Booth$$s algorithm performs multiplication by finding the

product of $000010012($M$)$ and $010010112($B$).$ Each step in the calculation

should be given. Give the final result in a $16$ bit binary format