Good explanation would be very nice :)

Suppose you are given a relation R with four attributes ABCD. For each of the following sets of FDs, assuming those are the only dependencies that hold for R, do the following: (a) Identify all candidate key(s) for R. (b) Identify the best normal form that R satisfies (1NF,2NF,3NF,BCNF). (c) If R is not in 3NF/BCNF, then follow the methodology presented in the lecture to decompose it into a set of 3NF/BCNF relations that preserve the dependencies. 1. CD,CA,BC 2. BC,DA 3. ABCD,DA 4. AB,BCD,AC 5. ABC,ABD,CA,DB Suppose you are given a relation R with four attributes ABCD. For each of the following sets of FDs, assuming those are the only dependencies that hold for R, do the following: (a) Identify all candidate key(s) for R. (b) Identify the best normal form that R satisfies (1NF,2NF,3NF,BCNF). (c) If R is not in 3NF/BCNF, then follow the methodology presented in the lecture to decompose it into a set of 3NF/BCNF relations that preserve the dependencies. 1. CD,CA,BC 2. BC,DA 3. ABCD,DA 4. AB,BCD,AC 5. ABC,ABD,CA,DB