Consider a relation T with six attributes ABCDEF where AB is a composite primary key for T. Assume T has the following functional dependencies: AB -> CDEF A -> CEF F -> E In what normal form is relation T? Explain why? Is it possible to decompose T into a number of relations in order to achieve a higher normal form? Explain how. Solution T(A,B,C,D,E,F) AB -> CDEF A -> CEF F -> E The relation T is in First Normal Form assuming all attribute values are atomic. But it is not in second normal form because attribute E is functionally dependent on the attribute F.But F is not part of key attributes so relation is not in second normal form. attribute.A relation is in second normal form if all non key attributes are fully functionally deprndent on attribute keys. Yes , it is possisble to decompose the relation into number of relations in order to achieve the higher normalization. Following are the tables into which we can decompose the relation T Table1(A,C,E,F) Table2 (A,B,D) Table3 (F,E) underlined attributes are primary keys.