Use a truth table to verify the first De Morgan law (p ∧ q) ' ≡ p' ∨ q'.

The table is shown below.

Step-by-step explanation:

Demorgan's Law:

(p∧q) ' = p'∨q'

Table:

p q p∧p (p∧q) ' = p' q' p'∨q'

1 1 1 0 = 0 0 0

1 0 0 1 = 0 1 1

0 1 0 1 = 1 0 1

0 0 0 1 = 1 1 1

where, p and q are the inputs, ∧ is the AND operator and ∨ is the OR operator.