For the Boolean Function F x,y, + x,y + xyz a. List the truth table, b. List the minterms (i.e., write down the function in Sum-of-Product Form) List the maxterms (i.e., write down the function in Product-of-Sums Form). c. d. Draw a logic diagram implementing the function. e. Draw a logic diagram implementing the function using only NAND gates. f. Simplify the function using a 3-variable Karnaugh Map g. Draw a logic diagram implementing the simplified function using only NAND gates (an inverter gate can be used when an inverted input is needed) h. Compare the number of gates used for unsimplified vs simplified implementation