What is correct answer...I am getting 2 as answer ...but answer given is 4


Find the total number of candidate keys for the following relation: R(A, B, C, D, E) with functional dependencies

{AB → C, C → D, D → E, E → A, D → B}

(A) 2

(B) 3

© 4

(D) 5


(AB),(AC),(AD),(DE),(BD) are the candidate keys.because if you find closure of the following keys then they will produce all the entities in a relation


Is the answer 3 since the primary key are C , D , AB