Both questions are the same for both adders so i'll call them Y.

1. Is there an equations for the number of full adders in a Y Adder?
2. If we will call X the pause (t_pd) of one full adder, what is the total t_pd of the Y adder?

For Carry-lookahead adder I think we will need 32 adders for Y, is it correct?. How can I calculate the t_pd?