don't use kmap

= 2 Module 9 Find a minimum cost implementation of the following function: f(x1, 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,, !X2, and !xz) is a zero-cost operation, meaning do not count the NOT gate and its input for !X , !X2, and !X3. For example, the cost of !x4+x2 is 3, 1 OR gate plus 2 inputs, !x, and xz. , 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