To check which functional dependencies (FDs) X→Y can be inferred, we compute the attribute closure X+ with respect to the given set of FDs:
Check PS→T and PS→Q (Options A and D):
Initial closure: (PS)+={P,S}
Applying P→QR: (PS)+={P,Q,R,S}
Applying RS→T: since {R,S}⊆(PS)+, we add T, giving (PS)+={P,Q,R,S,T}
Since T∈(PS)+, PS→T holds (Option A is correct).
Since Q∈(PS)+, PS→Q holds (Option D is correct).
Check R→T (Option B):
Initial closure: R+={R}
No functional dependency can be applied since RS→T requires both R and S.
Thus, R+={R}. Since T∈/R+, R→T cannot be inferred (Option B is incorrect).
Check P→R (Option C):
From P→QR, by Armstrong's Decomposition Rule (or using P+={P,Q,R}), P→R holds (Option C is correct).
Therefore, the correct options are A, C, and D.