Final answer:
To find the minimal SOP and POS form of the logical function F(W,X,Y,Z) = ΠM(1,6,7,8,9,12) + d(0,4,10,11,14), one must use Karnaugh maps by plotting the given minterms and don't-care conditions, and then grouping the adjacent 1s and 0s respectively.
Step-by-step explanation:
The question is asking for the minimal Sum of Products (SOP) and Product of Sums (POS) form of a given logical function F using Karnaugh maps (Kmaps) which is a method to simplify Boolean algebra expressions.
The provided logical function is F(W,X,Y,Z) = ΠM(1,6,7,8,9,12) + d(0,4,10,11,14), where Π denotes the product of maxterms and d denotes don't-care conditions.
To find the minimal forms, we would populate a Kmap with the minterms (1,6,7,8,9,12), note the don't-care conditions (0,4,10,11,14), and then group together adjacent 1s (for SOP) and 0s (for POS) to find the simplest expression.