1. Sketch a diagram of the group PG tree for a 32-bit Ladner-Fischer adder.
2. Write a Boolean expression for Cout in the circuit shown in Figure 11.6(b). Simplify the equation to prove that the pass-transistor circuits do indeed compute the majority function.
