(M1) Multiply - 4 x 2 using Booths algorithm. Show the steps. Assume if 4-bit word-size. Recall that: 00 -> no operation shift right product (with sign extend) 01 -> product = left side of product + multiplicand shift product right (with sign extend) 10 -> product = left side of product - multiplicand shift right product (with sign extend) 11 -> no operation shift product right (with sign extend) Note, do not add the Ob for this question. Operands Binary Multiplicand Multiplier step 0-Initial Is:0000 rs:0010 b:0 1- Action 1- Product ls: rs: b: 2 2- Action 2- Product Ils: rs: b: 3- Action 3- Product Is: rs: b: 4- Action 4- Product Is: rs: b