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]-5[1])method. Two components that perform this operation are prefixed “half-” and (10[4])“full-” depending on the (10[1])existence (10[1])of a (-5[1])carry signal. The XOR (“X-or”) logic gate is equivalent to performing this (10[1])action modulo (10[5])2. The (10[1]-5[1])binary (10[1])form of this (10[1])action (-5[1])yields zero if both inputs are (-5[2])one. For 10 points, name this (-5[1])operation exemplified by “1 + 1 = (10[1])2.” (10[7]0[1])■END■