2. Multiplication of two 32-bit numbers using Booth's algorithm requires addition of 16 32-bit numbers. Using a fast (minimum delay) and efficient scheme to perform additions, determine the total delay in performing addition of these 16 numbers for the two cases given below. You can use any number of adders either in parallel or series. Show clearly all the steps in arriving at the final result. (a) You can only use 8-bit Carry Lookahead (CLA) adders. (b) You can use a combination of 8-bit carry-look ahead (CLA) adders and carry-save (CSA) adders. (c) Which scheme is more efficient in terms of speed and cost. 2. Multiplication of two 32-bit numbers using Booth's algorithm requires addition of 16 32-bit numbers. Using a fast (minimum delay) and efficient scheme to perform additions, determine the total delay in performing addition of these 16 numbers for the two cases given below. You can use any number of adders either in parallel or series. Show clearly all the steps in arriving at the final result. (a) You can only use 8-bit Carry Lookahead (CLA) adders. (b) You can use a combination of 8-bit carry-look ahead (CLA) adders and carry-save (CSA) adders. (c) Which scheme is more efficient in terms of speed and cost