In a ripple carry adder, the carry bit must propagate through each full adder in sequence. The worst-case delay happens when the carry bit propagates through all full adders, as it takes the longest time for the carry to be computed.
Therefore, the correct answer is option (2).
Which of the following is a functionally complete set of gates ?
(i) NAND
(ii) NOT