To solve this problem, we need to construct a truth table for the given logical expression:

$(\neg p \land q) \rightarrow (p \land \neg q)$

Where:

• $\neg p$ means "not $p$" (negation of $p$),
• $\land$ is the logical AND,
• $\rightarrow$ is the logical implication.

Steps to Construct the Truth Table:

1. List all possible truth values for $p$ and $q$. Since each variable can be either true (T) or false (F), there are 4 possible combinations.
2. Compute the truth values for each sub-expression step by step.
3. Determine whether the statement is a tautology by seeing if the final column is always true.

Here is the truth table layout for the expression: