Step 1: Use decomposition on \(P \rightarrow QR\).
From \(P \rightarrow QR\), by decomposition, we get:
\[
P \rightarrow Q \text{and} P \rightarrow R.
\]
Hence, statement (C) is true.
Step 2: Infer \(PS \rightarrow T\).
From \(P \rightarrow R\), by augmentation with \(S\), we obtain:
\[
PS \rightarrow RS.
\]
Given \(RS \rightarrow T\), by transitivity:
\[
PS \rightarrow T.
\]
Hence, statement (A) is true.
Step 3: Infer \(PS \rightarrow Q\).
From \(P \rightarrow Q\), by augmentation with \(S\), we get:
\[
PS \rightarrow Q.
\]
Thus, statement (D) is true.
Step 4: Eliminate incorrect option.
There is no dependency that allows inferring \(R \rightarrow T\) without \(S\). Hence, (B) is false.
Consider the following relational schema along with all the functional dependencies that hold on them.
R1(A, B, C, D, E): { \( D \rightarrow E \), \( EA \rightarrow B \), \( EB \rightarrow C \) }
R2(A, B, C, D): { \( A \rightarrow D \), \( A \rightarrow B \), \( C \rightarrow A \) }
Which of the following statement(s) is/are TRUE?