The following logic functions have one or more essentials prime implicants; find their minimum sums.

I'm primarily interested in c. I'm having trouble understanding how to put this in a Karnaugh map. Please explain.

3.48 A distinguished I-cell in a logic function's Karnaugh map is a cell (and ac sponding input combination) that is covered by only one prime implicant. an essential prime implicant must be present in any minimal sum for the fu Thus, an efficient minimization algorithm looks first for essential prime cants, and then selects additional prime implicants only as needed for I-cellst are still uncovered, if any. The following logic functions all have one or essential prime implicants; find their minimal sums: (a) F=.YZ( 1.3.5,6,7) (c) F Ilwxy(1,4.5, 6, 7) (b) F=GwXYZ( 1,4,5,6, 7,9,14,15) (d) F=4mXYZ(0, 1.6, 7,8,9, 14, 15)