Consider an relation of R(A, B, C, D, E, F), with a set of functional dependencies F= E D, CB, CEF, BA, please answer the following questions:

1. Find all candidate keys (i.e., minimal keys) of relation R. Show all the steps you took to derive each key.

2. What is the highest level normal form that relation R can satisfy. ]

3. Decompose the relation R to 3NF.

Question 3 (10 marks) Consider an relation of R(A, B, C, D, E, F), with a set of functional dependencies F= E D, CB, CEF, BA, please answer the following questions: you tok to d inimal keys) of relation each key. 13 marks] 2. What is the highest level normal form that relation R can satisfy. [3 marks] 3. Decompose the relation R to 3NF. [4 marks]