1. Given a relation R(A, B, C) and a functional dependency (FD) set F(A B,BC), find the FD closure. Show your steps clearly. Enumerate all the FDs, and organize them according to the left-hand side of the FDs. Please also underline the "trivial FDs". 2. Consider the schema R(A, B,C,D, E) and the set of functional dependencies F [C- D, AC BE,D> A) that hold on R. (i) Find the attribute closure of D (i.e. D'). Show your steps. ii) Find all the candidate keys of R. Show your steps. Obtain a lossless join decomposition of R, such that all the relations derived are in BCNF. Is your decomposition dependency preserving? Explain