Suppose by applying the BCNF algorithm we decompose the original relation R into two new relations S and T.
Let the lower-case letter denote the set of attributes in the relation. For instance, if R has the schema R(a, b ,c), then r = {a, b, c}.
Question: Which of the following best describes the relationship between r, s, and t?
A. r - s = s - t
B. r = s - (s - t)
C. r = s + (t - s)
D. r - t = r - s