Carry out the cycle$-$by$-$cycle $($sequential$)$ procedure of Booth algorithm in multiplying the two $6-$bit $2\text{'}$s $-$complement numbers: multiplicand $($A$)$: $011010,$ multiplier $($B$)$: $110101.$ Note: Use B as the multiplier for bit scanning per cycle. No credit will be given if A is used as the multiplier.