suppose you are given a relation R = (A, B, C, D, E) with the
following functional dependencies (CE D, D B, C A)
(a). find all candidate keys
(b). identify the best normal form that R satisfies (1NF, 2NF, .......
BCNF).
(c). If the relation is not in BCNF, decompose it until it becomes
BCNF. At each step, identify a new relation, decompose and re-compute
the key and the normal forms they satisfy