Hello, mcdonagh521!

Let and be subsets of some universal set

Use DeMorgan's Laws to show that: . is equal to one of the following:

. .

We have: .

. . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . answer (a)