Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. (i) (ii) (iii) R(P,Q,R,S,T, U, V,W) Functional Dependency: RW V,P QR, QRUW,TP,U TV Find all the minimal super keys of the relational table R. List the derivations of all minimal keys. Identify the highest normal form of the relational table R. Remember that the identification of a normal form requires analysis of the valid functional dependencies. Decompose the relational table R into minimal number of normalized relational tables in BCNF. Remember to indicate the primary key and foreign keys (if any).