7.30 Consider the following set F of functional dependencies on the relation schema
(A, B, C, D, E, G):
A → BCD
BC → DE
B → D
D → A
a. Compute B+.
b. Prove (using Armstrong’s axioms) that AG is a superkey.
c. Compute a canonical cover for this set of functional dependencies F; give
each step of your derivation with an explanation.
d. Give a 3NF decomposition of the given schema based on a canonical
cover.
e. Give a BCNF decomposition of the given schema using the original set F
of functional dependencies.