The text states that a truth table or equivalent is the starting point for traditional combinational minimization methods. A karnaugh map itself contains the same information as a truth table. Given a sum-of-products expression, it is possible to write the 1s corresponding to each product term directly on the map without developing an explicit truth table of minterm list, and then proceed with map minimization procedure. In this way, find a minimal sum-of-products expression for each of the following logic functions.
a) F= X' * Z + X * Y +X *Y' *Z