1. We have seen that XY is actually XY+XY. Given F below, answer the questions that follow. Remember that XOR has the lowest operator precedence. F=YZ(YX) a. Draw the circuit for F using XOR gates for the XOR operators. b. Rewrite the expression replacing the XORs with the equivalent AND/OR/NOT operators. Do not simplify it aside from removing any double negations. c. Draw the circuit for the revised expression in part b. d. How many total gates are used in your circuit for part a and how many for part b/c ? Note that a NAND or NOR is considered 2 gates (an AND or OR and a NOT)