Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
Θ(1)
Θ(Log (n))
Θ(√ n)
Θ(n)
This question is part of this quiz :
