its discrete mathematics for computing question

Problem 4.11. The NAND of p and q, denoted by plg, is the progositson "not both p and q. The NAND of p and q is false when p and q are both true asd true otherwise. (a) Draw a truthi table for NAND (c) Expiess pAd asing only . (That means yoa cannot ase ,V4A, of atry other boolesh operator exoept for I. Thus, your arswer ahould only iavolve p, g. asd parentheses.) Your answer should be as sitnple as poosthle. Give a truth table that shows they are the same