Apply K-map to simplify Boolean functions in the following questions (Q1 and Q2). Q2: need to draw the logic circuit diagrams. 1.Simplify the following Boolean function F, together with the don't care conditions d, and then express the simplified function in sum-of-minterms form: (a) F(x, y, z) = (0, 1,4,5,6) d(x, y, z) = (2,3,7) (b) F(A, B, C, D) = (4, 12, 7, 2, 10 ) d(A, B, C, D) = (0,6,8) 2. Simplify the following functions, and implement them with two-level NAND gate circuits: (a) F(A, B, C, D) = AC'D' + A'C + ABC + AB'C + A'C'D' (b) F(A,B,C,D) = A'B'C'D + CD + AC'D (C) F(A, B, C,D) = (A' + C + D')(A' + C') (C' + D')