Use the K-map method to find the minimized product of sums expressions for the following Boolean functions: a. f(A, B, C) = (A B). C Notice that (A B = A e B) b. f(A,B,C,D) = {m,(1, 2, 4, 5, 10, 14)+ Ed(0,6, 13, 15) Where Edz(...) means the sum of minterms that correspond to don't care outputs