tot Use K-maps to find the minimum-cost SOP and POS expression for the following logic function: f(A,B,C,D) = ABC + AB + BCD + CD + ABCD Assuming that there are also don't-cares defined as D = 2(6, 8, 13, 15)