please solve these questions.

Module 9 Find a minimum cost implementation of the following function: f(xy, X2, X3) = TTM(0, 4, 5, 6, 7) In this situation, cost is defined as the number of logic gates (ANDs, ORs, and NOTs), plus the number of gate inputs. However, complementing the inputs (!x,, !Xy, and !xz) is a zero-cost operation. Hint 1: You could start by finding the canonical SOP or POS (whichever is better for this situation), and then, if necessary, use Boolean algebra to simplify further. Hint 2: your final solution should have a cost of 6. Module 10 Give the Truth Table for this logic circuit: a b D I d Module 11 Convert the following circuit into a NAND only circuit. Use NAND gates for any necessary inversions. X1 pod X2 3 -f XA Module 12 Convert the following logical network into one which only uses NOR gates: A B D E D F G H