Consider the Boolean function below. y = ((a v b) A c) ^ ((a ^ d) V (b ^ d)) ^ e (a) Use Boolean properties to rewrite the above function as a minimal product of sums. (b) Use factoring and DeMorgan's theorem to rewrite and simplify the expression above into one with the least number of literals. (c) Design and draw an implementation of your result in (b) using only 2-input NOR gates. You can assume that true and complemented versions of each literal are available as inputs (a and -a can both be used as inputs without needing an INV). (d) Using the design in (c) as the starting point, implement the function using only 2-input NAND gates (again, true and complemented inputs are available). Answer the question for all parts in the space below