Consider the relation schema R = (N, Y, P, M, C) and assume that the following set of functional dependencies hold on R:

F = { N M, NY P, M C}

Use the algorithm example below for question 2.

2. Use the second algorithm given above to find a lossless-join and dependency preserving decomposition of R into 3NF. Make sure to show all details

Input: R, F Output: a lossless-join, dependency preserving 3NF decomposition of R Let Fo be a canonical cover for F for each functional dependency Bin Fo do if none of the schemas R 1 sj i contains anB I a B if none of the schemas Ri 1 j si contains a candidate key for R i i 1 Ri any candidate key for R remove redundant relations repeat if any schema R is contained in another schema Rkthen delete R Ri R until no more Ri s can be deleted return (R1, R R0