Question:

Question 3 I11 marksl Consider the relation schema R-ABCDEGH, with the set of functional dependencies F A BGH, CD A, D-EG, E BC, GE a) [6 marks] Find a minimal cover for F. b) [2 marks] Find all candidate key(s) of R. c) [3 marks] Use 3NF Synthesis to find a 3NF decomposition of R that is both lossless-join and dependency-preserving. You must show all FDs that hold on each of the resulting relations. You do not need to show FDs that are trivial or implied by other FDs in the same set, but you must show all others