Construct a 4-bit carry-lookahead adder and compare it's longest (critical) path delay to that of a 4-bit ripple-carry adder

3 Carry-Lookahead Addition Const ruct a 4-bit carry-lookahead adder and compare it's longest (critical) path delay to that of a 4-bit ripple-carry adder. Gate delays are shown in table 2, and you wil only be allowed to use the gates listed in table 2 to construct your carry-lookahead adder. Assume that a full-adder is constructed as shown in figure Y Delay Gate Inverter 2-imput AND 2-input OR 2-input XOR 3 2 2 Table 2: Gate delays AD x1 X4 X2 B D X3 Cout x5 Sum Figure 1: Full adder schematic