Question: 115 marks! Consider a relation schema N (R, F) where R-A, B, C, D} and F= A->B, CD. Perform the following tasks. Justify your answers.

115 marks! Consider a relation schema N (R, F) where R-A, B, C, D} and F= A->B, CD. Perform the following tasks. Justify your answers. 1) Identify all keys for N. Show your process. 2) Identify the highest normal form (INF, 2NF, 3NF, BCNF) that N satisfies. 3) If N is not in 3NF, compute a lossless transformation into a set of 3NF relation schemas that preserve attributes and functional dependencies. less property, satisfi that all attributes and functional dependencies are preserved
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
