Will RATE Answer Afterwards. Thanks!

2. Consider the schema (R, F), where R ABCDEG, and the set of FDs F [GC-> EB, EB >CD, A->B, E->AC, CA) i. Show if the FDf G D is sound. ii. Show if the FDf: BEG-ACD is sound iii What are the keys for this table? Provide justifications. iv. write a CREATE ASSERTION statement to enforce constraint EB?CD. v. Calculate the minimal cover of F. Show the results after each step. vi. Use the 3NF synthesis algorithm to decompose the schema into a set of 3NF schemas. Explain ifthis decomposition is lossless and/or dependency-preserving