1. (45 points) Assume the following binary numbers are represented in 5-bit 2's complement form Perform the following operations. For subtraction, please first convert it into addition. In each case, please write the carries generated clearly and please indicate whether or not overflow occurs a) (15 points) 01111 +01010 b) (15 points) 11000 +01101 11000 + 01010 + 011 0 1 c) (15 points) 01010 11101 01010 11101 2. (55 points) Assume that AND, OR and NOT gates are implemented as CMOS circuits. Assume AND gate and OR gate of any number of inputs are available. Assume 2-input XOR gate is implemented using 8 transistors. (The design can be found in Fig. B.55 (page 788) of textbook but it is not important here.) a) (10 points) How many transistors are required to implement the half-adder as shown in Figure 3.1(c) (page 125)? b) (10 points) How many transistors are required to implement the full-adder as shown in Figure 3.4(b) (page 129)? c) (25 points) Consider another implementation of a full-adder. Suppose the functions ci+1 and si are simplified in SOP form using K-map. Then the two simplified SOP expressions are implemented separately using AND, OR and NOT gates. Please draw the circuits implementing the two expressions. How many transistors are required? d) (10 points) How many transistors are required to implement a 32-bit ripple-carry adder as shown in Figure 3.5 (page 130) if full-adders are implemented as in part (b)