Question 1.

Given a relation R (A, B, C, D, E, F) in 1 NF and its functional dependency set: F={A→ CE, E-F.D→

B).

(i) Find candidate key of R

(i) Decompose R into 3NF

Submit Q1.pdf/Q1.docx file. Please Show all the working. Do not simply write answers. If essential

steps, such as edge diagrams, transitive inferences are missing, points will be deducted.