Consider the relation R={A,B,C,D,E,F,G,H,I,J} and the set of functional dependencies F={{A,B}{C},{A}{D,E},{B}{F},{F}{G,H},{D}{1,J}}. 1) Proof {A}{D,J} holds by using inference rules. (10 marks) 2) Whether {A,B,D} is a super key? Whether {A,B,E} is a candidate key? Why? (10 marks) 3) Whether {B,C} is a super key? Whether {B,C} is a candidate key? Why? (10 marks) 4) Decompose R into 2NF. (10 marks) 5) Decompose R into BCNF. (10 marks)