3. (30 points) Given the relation R(A,B,C,D,E, F,G,H) and its functional dependencies: (1) Show how to find a (minimum) key for R. (4 points) (2) Is R currently in BCNF? Explain? (4 points) (3) Use one step of the BCNF decomposition to decompose R into two subrelations. (The answer could vary depending on which dependency you pick first.) (4 points) (4) Show that your decomposition from part (3) is lossless. (4 points) (5) Is your decomposition
OR
OR