Given the following truth table:

x y z w f x y z w f

0 0 0 0 0 1 0 0 0 1

0 0 0 1 0 1 0 0 1 1

0 0 1 0 1 1 0 1 0 1

0 0 1 1 1 1 0 1 1 1

0 1 0 0 1 1 1 0 0 0

0 1 0 1 1 1 1 0 1 1

0 1 1 0 0 1 1 1 0 0

0 1 1 1 0 1 1 1 1 0

1. Draw a Karnaugh map for this function.

2. Write the "optimal" Boolean polynomial representation of this function (fewest gates) using the information in the Karnaugh map.