Computer Organization and Embedded Systems (6th Edition)

Chapter 9, Arithmetic problem 12P

[M]Extend the Figure 9.14btable to 16 rows, indicating how to recode three multiplier bits: i+ 2, i+ 1, and i. Can all required versions of the multiplicand selected at position i be generated by shifting and/or negating the multiplicand M? If not, what versions cannot be generated this way, and for what cases are they required?

I request a step by step solution for this, I need help, thank you.