Please explain how you arrived at your answer and show steps

Use the given values

3. (20 pts) In the approach of 'combinational-array-multiplier' (CAM) described in class using array of full-adders, answer the following questions. (a) Determine the exact number of AND gates and full-adders needed to build a CAM for unsigned 48-bit multiplication. (b) What is the worst-case delay for a 48-bit CAM? (c) Clearly show how a 3-bit CAM processes the multiplication of 111111 through all full adders to reach the correct result. Also determine the exact delay (in d) it takes to reach the result? (d) Redo problem (c) for 110101