Wallace trees are designs that [emphasize] contain components that perform this action. The Model K was devised by George Stibitz to showcase a proof of concept for this action. Kogge-Stone and Brent-Kung are examples of architectures that speed up this action. Those architectures introduce the logic vectors P and G to “look ahead” parts of this action and are significantly faster than the (*) “ripple” (10[1])method. Two components that perform this operation are prefixed “half-” and “full-” depending on the existence of a carry signal. The XOR (“X-or”) logic gate is equivalent to performing this action modulo 2. The binary form of this action (-5[1])yields zero if both inputs are one. For 10 points, name this (-5[1])operation exemplified by “1 + 1 = 2.” (10[3]0[1])■END■