1. Write down the function represented by the following circuit network in a multi-level factored form using AND, OR, and NOT operations only -- that is, no NAND or NOR operations. Show your derivation

2. Derive the simplest Boolean expression (minimum number of literals and fewest number of gates) for this function represented by the above schematic.

3. Prove that the NAND gate by itself is functionally complete by showing how it can be used to implement AND, OR and NOT gates