7) (9 pts) Add-and Shift Multiplie Signed Multiplier (Booth) a) (3 pts) How many 1-bit flip-flops in total are needed as shift registers for a 48-bit multiplier to maintain the multiplier and final results? Why? b) (6 pts) Carry out the step-by-step procedure of Booth algorithm in multiplying the two 5-bit 2s- complement numbers: 13 x 11. Note: Use 11 as the multiplier and no need to verify intermediate results. 7) (9 pts) Add-and Shift Multiplie Signed Multiplier (Booth) a) (3 pts) How many 1-bit flip-flops in total are needed as shift registers for a 48-bit multiplier to maintain the multiplier and final results? Why? b) (6 pts) Carry out the step-by-step procedure of Booth algorithm in multiplying the two 5-bit 2s- complement numbers: 13 x 11. Note: Use 11 as the multiplier and no need to verify intermediate results