Database Manegment

3. Consider schema (R,F),where R ABCDE, F C EA, E-D, DB C, AC E i. Find all the keys of the relation, and for each one, prove it is indeed a ii. Decompose the schema into a set of BCNF schemas. Is this decomposition i. What is the attribute closure of EAB? key. lossless? Is it dependency-preserving? Explain your answer Use the 3NF synthesis algorithm to decompose the schema into a set of 3NF vii. schemas. Explain if this decomposition is lossless and/or dependency-preserving