Consider the relation X (P, Q, R, S, T, and U) with the following set of functional dependencies , Consider the relation X (P, Q, R, S, T, and U) with the following set of functional dependencies

Solution

C. {P, S}→{S}

Explanation

A functional dependency X -> Y is trivial if Y is a subset of X. In relational database theory, a functional dependency is a constraint between two sets of attributes in a relation from a database. In other words, functional dependency is a constraint that describes the relationship between attributes in a relation. The result is {P, S} →{S}