1.6 Consider the multiplication of two 9-bit numbers A and B…

1.6 Consider the multiplication of two 9-bit numbers A and B, with A = 101101101. Using the booth encoding algorithm, which B value will result in the largest number of partial products? (2 pts) a. 101010101 b. 111111111 c. 100011111 d. 111110101     [Write down your answers on your solution papers. No explanation is needed.]