Problem 4: Faster Adders As discussed in class, propagation delay is a property of combinational logic which characterizes the delay from the arrival valid inputs to a valid output. The propagation delay of a combinational system is the worst case delay through the system's components from any of it inputs to a specified output. A. Consider the following implementation of a full-adder, FA, with component delays of tpd(XOR) 4 nS, tpd(AND) 4 nS, and What is the aggregate tpd for each output? B. What is the aggregate tpd for the ollowing 2-input multiplexor with pd(NAND) 1 nS, and tod NOT) 1nS C. Use your answers from part A to compute the the propagation delay of the most-significant bit, Sg, in the following 10-bit adder circuit D. Finally, use your answers from parts A and B to compute the the propagation delay of the most-significant bit, Sg, in the following 10-bit adder circuit Problem 4: Faster Adders As discussed in class, propagation delay is a property of combinational logic which characterizes the delay from the arrival valid inputs to a valid output. The propagation delay of a combinational system is the worst case delay through the system's components from any of it inputs to a specified output. A. Consider the following implementation of a full-adder, FA, with component delays of tpd(XOR) 4 nS, tpd(AND) 4 nS, and What is the aggregate tpd for each output? B. What is the aggregate tpd for the ollowing 2-input multiplexor with pd(NAND) 1 nS, and tod NOT) 1nS C. Use your answers from part A to compute the the propagation delay of the most-significant bit, Sg, in the following 10-bit adder circuit D. Finally, use your answers from parts A and B to compute the the propagation delay of the most-significant bit, Sg, in the following 10-bit adder circuit