A Boolean function f(x,y,z,w) has the rows with output value 1 defined by the set:

S(f) = { (0,0,0,1), (0,1,0,1), (1,0,0,0), (1,0,0,1), (1,1,0,0), (1,1,0,1), (1,1,1,0), (1,1,1,1) }

a. Draw the Karnaugh map for this Boolean function.

b. Write a Boolean polynomial for this function that will require the fewest AND, OR, and NOT gates. (Only 2-input AND and OR gates are allowed.)