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