a) Consider the following relation. R1(A,B,C,D,E,F) FD: 1 {:[ABrarrCD],[BCrarrDE],[EFrarrA],[DrarrE],[ErarrF]:} I i) Find out all candidate keys for the given relation. i) Check whether BErarrCD,ABrarrF and DErarrAC is a valid functional dependency for the relation or not, Justify your answer using Amrstong's Axiom's. iii) Find out the canonical cover for the given functional dependencies: iv) Check and justify in which normal form the relation is. b) Consider the following relation; R2(A,B,C,D,E,F) FD: {:[ABrarrC],[CDrarrE],[EFrarrAB]:} } Suppose, we want to decompose the relation in following way, R21(E, F, A, B) R22(C,D,E) Will it preserve the dependencies? Justify your answer with proper explanation. c) Check whether the following decomposition of the re