Apply De Morgan's law to each expression to obtain an equivalent expression in which each negation sign applies directly to a predicate. For example,

is an acceptable final answer, but not

or

$($a$)$

$($b$)$

$($c$)$

$($d$)$