We want the negation of the statement ∼s∨(∼r∧s). In symbols we therefore start with
¬(∼s∨(∼r∧s)).
First recall De Morgan’s law for two statements: ¬(A∨B)=¬A∧¬B. Here we may identify
A=∼s,B=(∼r∧s).
Applying the law gives
¬(∼s∨(∼r∧s))=¬(∼s)∧¬(∼r∧s).
The first part simplifies directly because double negation cancels:
¬(∼s)=s.
So we now have
s∧¬(∼r∧s).
We still need to simplify the second negation. Again, by De Morgan’s law, but this time for a conjunction, ¬(A∧B)=¬A∨¬B. Taking
A=∼r,B=s,
we get
¬(∼r∧s)=¬(∼r)∨¬s.
Double negation on the first term yields
¬(∼r)=r.
Thus
¬(∼r∧s)=r∨¬s.
Substituting this back, our whole expression is now
s∧(r∨¬s).
Next, we distribute the conjunction over the disjunction using the distributive law P∧(Q∨R)=(P∧Q)∨(P∧R). Here P=s,Q=r,R=¬s, so we obtain
s∧(r∨¬s)=(s∧r)∨(s∧¬s).
However, s∧¬s is a contradiction and always evaluates to false, so that term can be dropped:
(s∧r)∨false=s∧r.
We have therefore shown
¬(∼s∨(∼r∧s))≡s∧r.
Hence, the correct answer is Option A.