Q5 (10 Points) Find the complement of the following functions by applying DeMorgan's theorems as many times until it cannot be applied anymore: (b) F2-x(y'z'+ yz) Q6 (10 Points) Express the following function as a sum of minterms (e.g., F 2(3, 6, 8)) and as a product of maxterms (e.g., F-I(3, 6, 8)): (show all steps) F(A, B, C, D) B'D A'D BD Q7 (10 Points) Express the complement of the following functions in sum-of-minterms form: (a) F(A,B,C, D)-(2, 4, 7, 10, 12, 14) (b) F (x, y, z)-(3, 5, 7) Q8 (10 Points) Simplify the following Boolean functions, using Karnaugh maps: (a) F(A,B ,C, D)- (0, 2, 4, 5, 6, 7, 8, 10, 13, 15) (b) F(A,B,C, D)-AB'C+B'C'D + BCD +ACD + A B'C+A'BC'D Q9 (10 Points) Simplify the following Boolean function using Karnaugh map and implement it using only NAND gates: F(A,B,C, D)- (0, 1, 2, 3, 6, 10, 11, 14) Q10 (10 Points) Given a 4-bit input combination ABCD, implement a circuit with an output Z where Z is only 1 if the decimal value of the 4-bit input is dividable by 3 or by 4 without remainder (Note: Z is 1 for input value zero). a. Provide the truth table for this circuit. b. Use Karnaugh map to obtain the minimal sum-of-products Boolean expression of Z