1. Simplify the following Boolean functions using three variables K-maps and express your answer in minimum sum of products and minimum product of sums. a. b, c, F(A,B,C) = m(0, 1, 2, 3, 7) F(A,B,C)-'m (3,5,6,7) F(A,B,C)-r[M(0, 2, 3, 4, 6) Points 2. Simplify the following Boolean functions using three variables K-maps and express your answer in minimum sum of products and minimum product of sums. a. F(A,B,C)= A,B, + BC+ A'BC, Points 3. For the following Boolean expression F CD + ABC + ABC" + ABC, determine a. Truth table b. Sum of min terms c. Product of max terms d. Standard sum of products e. Standard product of sums f. Minimum sum of products g. Minimum products of sums h. Gate implementation using all NAND gates i. Gate implementation using all NOR gates. Points 4. Simplify the following Boolean functions using four variables K-maps and express your answer in minimum sum of products and minimum product of sums. a. b. c. F(A,B,C,D)=m (4,6,7,15) F(X,Y, Z,W)=UM(3,7,11,13,14,15) F(A, B, C, D) =m(0, 2, 4, 5, 6, 7, 8, 10, 13, 15)