For the Boolean function F(x, y, z) = x, y z + xy (a) Obtain the truth table of F. (2 points) 001 010 011 100 101 110 (b) Use Boolean algebra to simplify the function to a minimum number of literals. (Hint: 3 literals. You may use K-map to help you) (2 points) (c) Implement this Boolean function using AND, OR, and NOT gates. (2 points) (d) Implement this Boolean function using NAND gates only. (2 points)