We have to simplify the Boolean expression ∼(p⇒(∼q)) and write the result in one of the listed equivalent forms.
First, we recall the logical equivalence that defines an implication. The implication a⇒b is always equivalent to the disjunction (∼a)∨b. We will apply this fact to the inner implication p⇒(∼q).
So we write
p⇒(∼q)=(∼p)∨(∼q).
Substituting this back into the original expression gives
∼(p⇒(∼q))=∼((∼p)∨(∼q)).
Now we must remove the outer negation. For this we make use of De Morgan’s Law, which states:
∼(A∨B)=(∼A)∧(∼B),∼(A∧B)=(∼A)∨(∼B).
In our case A=(∼p)andB=(∼q). Hence
∼((∼p)∨(∼q))=(∼(∼p))∧(∼(∼q)).
Double negations cancel out, because ∼(∼r)=r for any statement r. Therefore
(∼(∼p))∧(∼(∼q))=p∧q.
Thus we have shown step by step that
∼(p⇒(∼q))=p∧q.
The equivalent option in the list is Option D.
Hence, the correct answer is Option D.