Database Management

2. Consider the schema (R, F), where R-ABCDE, and the set of FDs F GCEB i. Show if the FD f: G-D is sound i Show if the FD f: 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 if this decomposition is lossless and/or dependency-preserving