Consider Relational schema R (ABCDE) and Functional Dependency set
F= {AB → DE, C → E, D → C, E → A}
Find the strongest normal form of R(ABCDE) and the number of candidate keys respectively?
1
3 NF, 5 keys
2
3 NF, 4 keys
3
BCNF, 4 keys
4
2 NF, 5 keys