I was able to find the answer to (a) and (b), but I'd love some help on (c) and (d). The answers to (a) and (b) may be helpful for (c) and (d). Thanks.

3. All You Need is Nand, Nand, Nand... (20 points) The NAND connective takes two propositions and evaluates to False when both propositions are True and evaluates to True otherwise. In circuit diagrams, the gate for NAND is denoted by NAN HARI The NAND of p and q is written as p |q. Demonstrate that we can construct all the other connectives by just using NAND by writing propositional formulae for each of the following while only using NAND connectives and no constants like T or F Hint: It's okay to use a single input/output more than once. (a) [5 Points] (b) [5 Pointsl p Vq (c) [5 Points) pAg (d) [5 Pointsl p