4) (Synthesis from Minterms and Maxterms - 20 points) In class, we have seen how to synthesize optimal sum-of-product forms starting from the ON-set minterms of a function and implement the design using two- level AND-OR logic. In this problem, you will get more experience with this concept. Moreover, the duals of minterms and sum of product forms are maxterms and product of sum forms, respectively. Synthesis with product of sum forms and implementation using two-level OR-AND logic is described in Section 2.6.1, pp. 52 onwards. Please go through these concepts and study the solved examples when you attempt to solve this problem. Consider the Boolean function f(x, y, z) represented by the truth table shown in Table I. % + y2) TABLET TRUTH TABLE yo 2 y A90* 7 2 0 0 0 1 0 0 1 0 tyyt 0 1 0 1 0 1 1 || 1 1 0 0 0 1 0 1 1 1 0 1 1 1 a) Derive the Minterm Canonical form (Sum of Minterms) expression of the Boolean function f from the truth table. b) Simplify the sum of product form as much as possible. c) Derive the Maxterm Canonical form (also called the Canonical Product-of-Sum form) expression of the Boolean function from the truth table. d) Is the minterm canonical form of the function logically equivalent to its maxterm canonical form? If yes, prove the equivalence of the expressions. If not, prove otherwise. e) Implement the function using only NAND gates