Master Computers and Technology with Fun Quizzes & Brain Teasers!
Consider the following collection of relations and dependencies. Assume that each relation is obtained through decomposition from a relation with attributes ABCDEFGHI and that all the known dependencies over relation ABCDEFGHI are listed for each question. (The questions are independent of each other.)For each (sub)relation: (1) State the strongest normal form that the relation is in. (2) If it is not in BCNF, decompose it into a collection of BCNF relations.a. R1(A,C,B,D,E), A B, C Db. R2(A,B,F), AC E, B Fc. R3(A,D,G), D G, G Hd. R4(D,C,H,G), A I, I Ae. R5(A,I,C,E)