Please show work by creating a diagram with the proper inputs to the questions

For $16$ bit multiplication $-$ using array multiplier; Assume only $2-$bit dull adders.

$1-$ What is the total number of add operations for generating the final results

$2-$ Assume that the time to generate the sum and the carry by one FA $=100$ nano$-$sec;

What is the total time required to produce the product of the $2-16$ bit numbers

$3-$ Using CLA adders, what is the total time to generate the product, given that a CLA generates the sum bit $S$ in $100$ nano$-$sec and the carry in $200$ nano$-$sec$.$

$4-$ Assume you have n$-$bit adders: The cost of n$-$bit adder is equal to $${10}^{**}n$;

Provide the cost of the array multiplier for $n=2,3,4,5,$dots