Solution to problem 2 in sample test II

Solution to Problem 2:
(a) Nine multipliers and 16 (5,5,4) counters.
(b) Ten 4-bit adders and three or four 4-bit carry-look-ahead modules depending on the number of levels in the carry-look-ahead tree.
(c) Only eight multipliers and at most 12 (5,5,4) counters.