Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas.
= (P,, , , T,, , W)
Fd: { :[Wâ ]
{ Pâ
{ Tâ P
{ â T
i. Determine the highest normal form, which is valid for a schema. Justify your answer. Justification must include the derivations of minimal keys from the functional dependencies and testing the validity of all normal forms (2NF, 3NF, BCNF) against the relational schemas, minimal keys, and functional dependencies.