Aufgabe 20: Kanonische berdeckung Canonical coverage Given the relation scheme R - {A; B; C;D; R; F; G) with the set F of the functional dependencies: - AD -> BC -D -> BEG - BG -> ABF -F-> CG - BC -> DF (a) Determine the attribute envelope of D. Use the algorithm presented in the lecture. Intermediate steps should be specified. Is DG a candidate key? Justify your answer. (b) Determine the canonical coverage of F (the minimum set of functional dependencies Fc that is equivalent to F). Include all steps of the algorithm. (c) Determine all candidate keys of relation R. How can the attribute shell be used