Express the following using only NOR operations (represented as ¬(P ∨ Q)):

A ∧ B

NOR is functionally complete, meaning any boolean function can be expressed using only NOR.