Question

boolean algebra help?

find the minimum cost product of sums for the function f(x,y,z)=m(1,2,3,5)

Answer 1

you may use k-map, but boolean minimization is also very simple is this particular case :-

f(x,y,z) = m(1,2,3,5)
= x'y'z + x'yz'+x'yz + xy'z

Answer 2

combine outer terms, and inner terms, + simplify