Using k-maps, find all minimum sum of products expressions. (If there is more than one solution, the number of solutions is given in parentheses.)

F(W, X, Y, Z) = Σm(1, 2, 4, 5, 8, 9, 10, 11) + Σd(3, 6, 7)