Please only answer if you can help with both! This is my fifth post!!

1.1 Let's compare the performance of ripple carry adder" and "carry lookahead adder". Assume that hardware corresponding to any Boolean equation containing only OR or AND terms, such as F = A. B or F = A + B, takes one time unit T. Equations that consist of the OR of several AND terms, e.g. F = A. B + CD, would take two time units, i.e., 27. The reason is that it would take T to produce the AND terms and then an additional T to produce the result of the OR. Calculate the performance ratio between 4-bit ripple carry adder" and "4-bit carry lookahead adder". If the terms in equations are further defined by other equations, then add the appropriate delays for those intermediate equations, and continue recursively until the actual input bits of the adder are used in an equation. 1.21. - What if we consider 16-bit adder? Calculate the performance ratio between "16-bit ripple carry adder" and four concatenated "4-bit carry lookahead adder". 1.1 Let's compare the performance of ripple carry adder" and "carry lookahead adder". Assume that hardware corresponding to any Boolean equation containing only OR or AND terms, such as F = A. B or F = A + B, takes one time unit T. Equations that consist of the OR of several AND terms, e.g. F = A. B + CD, would take two time units, i.e., 27. The reason is that it would take T to produce the AND terms and then an additional T to produce the result of the OR. Calculate the performance ratio between 4-bit ripple carry adder" and "4-bit carry lookahead adder". If the terms in equations are further defined by other equations, then add the appropriate delays for those intermediate equations, and continue recursively until the actual input bits of the adder are used in an equation. 1.21. - What if we consider 16-bit adder? Calculate the performance ratio between "16-bit ripple carry adder" and four concatenated "4-bit carry lookahead adder