Consider a set of functional dependencies F = {AB → C, C → AD, A→B} on a relation schema R(A, B, C, D).
(a) (10 points) Show the steps of computing a canonical cover forF.
(b) (10 points) Determine whether or not AD is a candidate keyusing the transitive closure of
some attributes.
(c) (10 points) Assume that R is decomposed into R1(A, B) and R2(A,C, D). Is this decomposition
dependency preserving? Justify your answer.
(d) (10 points) Determine whether or not R(A, B, C, D) is in BCNFand justify your answer using
the transitive closure of a set of attributes. If R(A, B, C, D) isnot
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured