Task 1- Normal Forms:

Relation R has the specified functional dependencies.

(a) Determine the canonical cover of the given functional

dependencies. Show all the steps of the algorithm.

(b) Relation R has one candidate key. State it and justify your answer briefly.

(c) In which highest normal form is relation R? Justify your answer briefly.

(d) Give a decomposition of relation R according to the synthesis algorithm .Show all steps of the algorithm, even if some of them are not

needed,

(e) Are the resulting relations Rim. R- from (d) in BCNF? Justify your answer