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 relation \(R(P,Q,S,T,X,Y,Z,W)\) with the following functional dependencies:
\[ PQ \rightarrow X; P \rightarrow YX; Q \rightarrow Y; Y \rightarrow ZW \] Consider the decomposition of the relation \(R\) into the constituent relations according to the following two decomposition schemes. \[ \begin{aligned} D_1 &: R = [(P,Q,S,T);\; (P,T,X);\; (Q,Y);\; (Y,Z,W)] \\ D_2 &: R = [(P,Q,S);\; (T,X);\; (Q,Y);\; (Y,Z,W)] \end{aligned} \] Which one of the following options is correct?