3. Consider the following relation and the set of functional dependencies (FDs): R = (A B C D E F G H I J) A C BC D EFG-HIJ ADE-BG AF EG DJ F B-E CF-BHI a. Find the minimal cover of FD set (10 pts). b. For each of the following decompositions, comment on whether they are dependency-preserving and they give a lossless join. Explain your approach (10*3 pts): i. R1(ACFH), R2(ABCDE), R3(BDEFGIJ), R4(ABCFGI) ii. R1(CEFGH), R2(CDEFGIJ), R3(ABCF), R4(ABCDEG) iii. R1(ACDEFG), R2(ABCDFGI), R(ADJFHI)