Armstrong’s Axioms and rules for splitting and combining.
Consider the relation R(A,B,C,D). For each of the following sets of FDs,
assuming those are the only dependencies that hold for R, do the following:
a) Identify the candidate key(s) for R.
b) Identify the best normal form (3NF or BCNF) that R satisfies.
c) If R is not in BCNF, decompose it into a set of BCNF relations.