Using the Boolean algebra identities and DeMorgan's Law, it is possible to simplify logic circuits. Simplification eliminates parens and can result in fewer operators (gates) being used. It can also result in gates with fewer inputs.
Simplify each of the following Boolean expressions. Then draw the logic circuit for the Boolean expression and the simplified version, and create the truth table for each to verify your work.