di 2.10 Suppose we would like to build function Y = 2X + 3 where X denotes a 3-bit unsigned value (x2x1x0), and Y=y4..y0 is a 5-bit value in hardware. Construct its truth table where input bits are x2, x1, and x0 and output bits are y4 through yo. Then do the following for output y2 (you may repeat this for the other outputs): a. Determine the canonical SOP expression for output bit y2. b. Write the min-terms for y2. c. Use K-map and find a minimal SOP expression for y2. d. Draw a minimal NAND circuit for y2. e. Compare the number of transistors required to implement the canonical and the bor minimal SOP expressions. 2.11 Repeat Problem 2.10 but this time use POS expressions for y2. 2.12 Repeat Problem 2.10 b through d but this time use 3-bit 2's complement values for X and output y4. 2.13 Repeat Problem 2.12 b through d but this time use POS expressions for y4. 2.14 Find a minimal SOP expression for each of the following functions using K-maps: a. fw, x, y, z)=E(0, 2, 8, 10) +E (12, 14) b. g(a, b, c, d)=E(5, 7, 13, 15) +E (6, 14) c. h(w, x, y, z)= II(0, 2, 8, 10)+11 (12, 14) d. t(a, b, c, d)= I1(5, 7, 13, 15) +11 (6, 14) in Problem