Let F(a, b, c, d) be a logic function whose truthtable is shown below. When the following logic equations hold, show the minimum sum of products form of the logic function G(X, Y, Z,W). The minimum sum of products form of a logic function f has the smallest number of product terms among those which represent f. If there are more than one forms having the smallest number of product terms, forms with the minimum number of literals are chosen. = X Y = a b c d F 0 0 0 0 0 0 0 0 10 0 0 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1 0 1 0 0 0 1 1 0 0 1 1 1 0 1 0 1 1 0 1 1 0 1 1 0 0 1 1 1 0 1 0 1 1 1 0 0 1 1 1 1 0 Z abc + bd + abd cd + bed + abd + acd abc + bod + bd abd + abd + cd + ac G(X, Y, Z, W) W = F(a,b,c,d)