Consider the schema R = (A, B, C, D, E) and let the following set F of functional dependencies holdforR: F = {A -> BC, CD -> E, C -> A, B -> D,}

1) Prove or disprove ADE is in the closure of F. A proof can be made by using inference rules IR1 through IR3. A disproof should be done by showing a relational instance (counter example) that refutes the rule.

2) What are the candidate keys of R = (A, B, C, D, E)? Explain your answer.