SOLVED: Consider the relation schema R = (A, B, C, D, E, F, G, H, I, J) with functional dependencies FD = B→E, E→FH, BCD→G, CD→A, A→J, I→BCDE, H→I. Determine if B→J holds and list every candidate key. Show each step.THENConsider a relation schema R(X, Y, Z) with the functional dependencies XY→Z and Z→X. Can we conclude that Y→XZ holds? If yes, please argue why. If no, please argue why not by giving a counterexample.