In Booth's multiplication algorithm, what is done when the bit pair (Qi, Qi−1) is (0, 1)?
- AAdd the multiplicand to A, then arithmetic shift right
- BSubtract the multiplicand from A, then arithmetic shift right
- CArithmetic shift right only, with no add or subtract
- DClear the accumulator to zero