Applying DeMorgan's Theorem to NAND Gates I need to draw the circuit represented by using traditional symbols. Next, I need to build the circuit and...

Applying DeMorgan's Theorem to NAND Gates

I need to draw the circuit represented by using traditional symbols.

Next, I need to build the circuit and input all possible combinations of x and y. Results need to be recorded in a truth table.

Finally, I need to compare the results with a truth table for a NAND gate having x and y as their inputs. What do you find?