When we looked at multiplication of signed operands, we saw in the class slides an example of multiplication of a positive multiplicand and a positive multiplier, and a negative multiplicand and a positive multiplier. Perform the multiplication algorithm which we described, using left shifting of a copy of the multiplicand, and addition, to determine whether it gives the correct result for the following examples, using 4 bit operands and a 4 bit result, and show all steps in performance of the algorithm, and then answer the four accompanying questions after each problem:

a. Positive multiplicand and negative multiplier (2 * -3)

i. Should the result fit in 4 bits?

ii. Is the correct result produced?

iii. Is there overflow from any of the addition operations (you can simply say if there is overflow from any one or more of them)?

iv. If there is overflow from any of the addition operations, does this make sense? Why or why not?

b. Negative multiplicand and negative multiplier (-2 * -3)

i. Should the result fit in 4 bits?

ii. Is the correct result produced?

iii. Is there overflow from any of the addition operations (you can simply say if there is overflow from any one or more of them)?

iv. If there is overflow from any of the addition operations, does this make sense? Why or why not?

Note: Do the intermediate additions one at a time; that is, every time there is a non-zero left-shifted copy of the multiplicand produced by examining the bits in the multiplier, add the left-shifted copy to the prior value of the result. Do not wait and try to add 3 or four left-shifted copies of the multiplicand in one addition operation.