Prove that the three basic connectives 'or', 'and' and 'not' can all be written in terms of the single connective 'notand' where 'P notand Q' is interpreted as 'not(P and Q)'.

So I made truth tables for ( P or Q) and (P and Q). I am not sure what the basic connective 'not' is. Is it (not P) / not(Q), or the negation of the individual statements? I figured out that . But I couldnt figure out the forms for or .

Any help is appreciated. Thanks.