Consider a relation R(A, B, C,D,E,G, H, I.J, K) and its FD set F A-BC,E 1) Check if C ?J ? F. ( 1 marks) 2) Find a minimal cover Fn for F. (2 marks) 3) Regarding F, is the decomposition R [ABCDE, R EGH), R-[EIJK] of R lossless-join? Please justify your answer. (2 marks) 4) List at least 5 super-keys for R. (2 marks) Is it possible to decompose R into a collection of BCNF relations and ensure the decomposition is dependency-preserving and lossless-join? Please justify your answers. (3 marks) 5)