1. Using a one-bit full adder as a building block, draw a circuit that performs addition of two 3-bit two's complement numbers named N and P. Also include an output signal (0) that is 1 when overflow occurs, 0 otherwise. HINTS: The three bits of Nare N[O], N[1], and N[2]. o N[O) is the least significant bit. The sum (output) is a three-bit 2C number named T. You don't need to draw the internal gates inside the full adder. o Draw the adder as a box, as shown below. Make sure all signals are labeled. . . A B FA Con S