The proposition p NOR q is logically equivalent to not(p v q). Prove that NOR is functionally complete, i.e., any propositional formula is equivalent to one whose only connective is NOR.

Which of the following options correctly represents the logical equivalence of p NOR q?

A) not(p v q)
B) not(p ^ q)
C) not(p -> q)
D) not(p <-> q)