database management system

= Consider a universal relation schema R(A, B, C, D, E, G, H, I, J, K) and F = {CD --> A, B --> EG, H --> IJ, K --> AC, EG --> IJ, JK --> AD) be a set of functional dependencies defined on the schema. Find out a minimal cover of F and normalize the schema R based on the minimal cover. Show all steps (functional dependencies in canonical form, removing extraneous attributes, if any and removing extra functional dependency, if any) in detail towards deriving minimal cover