Given R(A,B,C,D,E) which of the following two sets of functional dependencies make R a relation in 2NF?
F1={DE→ABC,E→C}
Vs.
F2={DE→ABC,C→E}
I almost sure that the F1 is not in 2NF and the F2 is in 2NF (as C does not depend on E — it's backward). But why doesn't the second one a 3NF?
I am basing my assumption on What are 1NF, 2NF and 3NF in database design?
Also I would be glad to get an example where F is modified so it would match 3NF — I want to know if there is another option/possibility than just {DE→ABC}.