Problem 1 and only
There are three ways of representing combinational digital logic: (1) a Boolean equation, (2) a truth table, and (3) an acyclic logic circuit.
Below are example of each of these three representations. Translate each representation into the other two.
 X' + Y Z' + (Y + Z) Y'

X Y Z out 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1