Consider a relation schema r(A,B,C,D,E, F) and a set of functional dependencies {A-> BCD,BC->DE,B->D,D->A}
1) Compute a canonical cover for the above set of functional dependencies (show each step of your derivation with an explanation).
2)Compute the closure of AF and then determine whether or not AF is a candidate key