I need help with this database management hw.

1.(6 pts) Consider the following instance: 4 4 4 4 4 (1) Does the functional dependency C>D hold in this instance? (2) Does the functional dependency D->C hold in this instance? (3) Does the functional dependency A->BCD hold in this instance? 2. (12 pts) Given a relation schema R-(A, B, C, D, G, H) and a set of functional dependencies : (1) Find (BD) in F (2) Find a candidate key for relations on schema R, and prove that your answer is a candidate key 3. (12 pts) Consider a relation schema R (A, B, C, D, E) with functional dependencies: F- A->E, C->D, D->BE. (1) Is the decomposition (A, C, E), (B, C, D) a lossless-join decomposition? Why or why not? (2) Is the decomposition (A, B, D), (C, D, E) a lossless-join decomposition? Why or why not