Optimize the following Boolean function by means of a 4-variable K-map in sum-of-products
(SOP) form.
F (W, X, Y, Z)
= ? m (0, 3, 4, 6, 11)
YZ
a.
WX
00 01 11 10
00 1 0 1 0
01 1 0 0 1
11 0 0 1 0
10 0 0 0 0
F = \overline{W} \overline{X} YZ + \overline{W} XZ + XYZ
YZ
b.
WX
00 01 11 10
00 1 0 1 0
01 0 0 0 1
11 0 0 0 0
10 0 0 1 0
c.
F = \overline{W}YZ + \overline{W}XZ + XYZ
None of above.