Parts A and B for both 16 and 17 is where I need help.

9.16 [M] Tree depth for carry-save reduction is analyzed in this problem. (a) How many 3-2 reduction levels are needed to reduce 16 summands to 2 using a pattem similar to that shown in Figure 9.19? (b) Repeat part (a) for reducing 32 summands to 2 to show that the claim of 8 levels in Section 9.5.3 is correct. (c) Compare the exact answers in parts (a) and (b) to the results obtained by using the approximation developed in Example 9.3 in Section 9.10. 9.17 [M] Tree reduction of summands using 3-2 and 4-2 reducers was described in Sections 9.5.3 and 9.5.4. It is also possible to perform 7-3 reductions on each reduction level. When only three summands remain, a 3-2 reduction is performed, followed by addition of the final two summands. (a) How many 7-3 reduction levels are needed to reduce 32 summands to three? Compare this to the seven levels needed to reduce 32 summands to three when using 3-2 reductions. (5) Example 9.3 in Section 9.10 shows that logak - 1 levels of 4-2 reduction are needed to reduce k summands to 2 in a reduction tree. How many levels of 7-3 reduction are needed to reduce k summands to 3? F E D B A Level 1 CSA C2 S2 C s Level 2 CSA C3 S3 Level 3 CSA CA S4 Final addition + Product Figure 9.19 Schematic representation of the carry-save addition operations in Figure 9.18