(20 points) Compare the complexity of a 16-bit adder implemented the following ways. As a ripple carry adder using the cascaded half adder as a full adder As a carry lookahead adder As a carry lookahead adder with 4-bit blocks and each block being a carry lookahead adder As a carry lookahead, ripple hybrid with 4-bit blocks and each block being a carry ripple adder You needn't implement these (portions of each have already been implemented). Create a table that compares the gate sizing (number of gates required for implementation) and the number time units to complete the computation. Assume that each gate, no matter the type or number of inputs and outputs, takes 1 time unit to complete. It may be helpful to inspect each style of adder in the notes to determine equations for calculating the number of gates and number of time units based on the number of bits in the adder. (20 points) Compare the complexity of a 16-bit adder implemented the following ways. As a ripple carry adder using the cascaded half adder as a full adder As a carry lookahead adder As a carry lookahead adder with 4-bit blocks and each block being a carry lookahead adder As a carry lookahead, ripple hybrid with 4-bit blocks and each block being a carry ripple adder You needn't implement these (portions of each have already been implemented). Create a table that compares the gate sizing (number of gates required for implementation) and the number time units to complete the computation. Assume that each gate, no matter the type or number of inputs and outputs, takes 1 time unit to complete. It may be helpful to inspect each style of adder in the notes to determine equations for calculating the number of gates and number of time units based on the number of bits in the adder