Please explain each answer and answer correctly.

Consider a relation R(A, B, C,D,E,G, H,I,J,K) and its FD set F A-BC,E- heck if C-JE F. (1 marks) l) 2) 3) Find a minimal cover Fm for F. (2 marks Regarding F, is the decomposition R,-(ABCDE), R,-{EGH], R,-{E?JK} of R lossless-join? Please justify your answer. (2 marks) 4) List at least 5 super-keys for R. (2 marks) 5) 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