Find the minimum cost Sum Of Prods and Product of Sum forms for the function

Find the minimum-cost Sum of Products and Product of Sums forms for the function: *f*(x1,x2,x3( = $\displaystyle \sum$m(1,2,3,5)

I know how to get the truth table etc. But they want me to use a karnaugh map to get the answer. How?

Re: Find the minimum cost Sum Of Prods and Product of Sum forms for the function

How do you measure the cost of a Boolean expression? There are several ways to do it. Also, there is no way around learning how to use Karnaugh maps. If you need a reference or have concrete questions about how they work, feel free to ask, but we can't learn Karnaugh maps for you.