We begin with the Boolean expression whose negation we must find:
∼s∨(∼r∧s).
Our objective is to compute its logical negation, that is, to evaluate
∼(∼s∨(∼r∧s)).
First, we invoke De Morgan’s law for the negation of a disjunction, which states:
∼(A∨B)=(∼A)∧(∼B).
Here, we identify A=∼s and B=(∼r∧s). Applying the law gives
∼(∼s∨(∼r∧s))=(∼(∼s))∧(∼(∼r∧s)).
Now, ∼(∼s) is simply s, because a double negation cancels itself. Substituting, we have
s∧(∼(∼r∧s)).
Next, we must simplify ∼(∼r∧s). We again use De Morgan’s law, this time for the negation of a conjunction:
∼(C∧D)=(∼C)∨(∼D).
Here, C=∼r and D=s. Therefore,
∼(∼r∧s)=(∼(∼r))∨(∼s).
The term ∼(∼r) simplifies to r.
Hence,
∼(∼r∧s)=r∨(∼s).
Substituting this back, the overall negation becomes
s∧(r∨(∼s)).
We now distribute s over the disjunction r∨(∼s). The distributive law of Boolean algebra tells us
X∧(Y∨Z)=(X∧Y)∨(X∧Z).
Taking X=s,Y=r,Z=∼s, we obtain
(s∧r)∨(s∧(∼s)).
The term s∧(∼s) is always false (it equals 0) because a proposition cannot be simultaneously true and false. Hence that term vanishes, leaving
s∧r.
We have therefore shown that the negation of the original expression simplifies to s∧r, which is exactly Option 2.
Hence, the correct answer is Option 2.