Introduction to Database Management System: Consider the following relation of students: R(A, B, C, D, E, F, G) (A is underlined) D is a candidate key. Suppose the following dependencies exist: FD1: A-> B, C, D, E, F, G FD2: C, D -> A, B, E, F, G FD3: D-> G FD4: F -> C Apply normalization until you cannot decompose the relations further. State the reasons behind each decomposition. Solution FD1: A-> B, C, D, E, F, G: This Functional dependency uniquely idendifies the table row so, all other functional dependecies are not need. we simply ignore all other. >>> for example it any of the FD voilates any of the NF then we will decompose it and create a new table for that FD. Here FD2 voilates 3NF but if we want to decompose it what could be the foreign key in R2 since all other attributes are present in relation R1:(A, B, C, D, E, F, G) . >>>Therefore FD1 is the final one for the Relation..