1. minimize the function f(a, b,c, d) = a’b’cd’ + a’bc’d’ + a’bc’d + a’bcd’ + ab’cd’ + ab’cd + abc’d’ + abc’d using both the k-map and the quine mcclusky tabular methods. a. on your k-map, first mark all pairs of 1s, then groups of 4. from your k-map, determine which prime implicants are essential & list them. b. how many pairs of 1s does the quine mcclusky process generate? are they the same pairs you found on your k-map? which prime implicants does quine mcclusky produce? are they the same as the ones produced by the k-map method?