Consider the following set F of functional dependencies on the relation schema r (A, B, C, D, E, F):
a. Compute B+.
b. Prove (using Armstrong's axioms) that AF is a superkey.
c. Compute a canonical cover for the above set of functional dependencies
F; give each step of your derivation with an explanation.
d. Give a 3NF decomposition of r based on the canonical cover.
e. Give a BCNF decomposition of r using the original set of functional dependencies.
f. Can you get the same BCNF decomposition of r as above, using the canonical cover?