please ans with explanation

Exercise 22: Normal forms and synthesis algorithm The relation scheme is given R={A,B,C,D,E,F, with the following amount ff the functional dependencies: AWAYCDE B.C CEF DA fE (a) Determine the canonical covering off. Give all the steps of the algorithm. (b) The relation Rhastwocandidate key. List them all and justify your answer. (c) In which highest normal form is the relation? R ? Justify your answer. (d) Give a decomposition of the relation Raccording to the synthesis algorithm. Give all the steps of the algorithm. (e) Are the resulting relations in part (d) in the BCNF? Justify your answer (for each relation)