Let R(ABCDEG) be a relation schema and let the set of functional dependencies satised by R be F={AB CD, BCD A, B C, E D}. (4.1) Compute aminimal cover of F. Show the steps in your computation. (4.2) Compute an LLJ BCNF decomposition of R. Is it possible to get a BCNF decomposition for the relation R which is both LLJ and fd-preserving? Showyour decomposition tree, and the fdsused in each decomposition step. Moreover, for each relation Ri at a leaf node in the tree, showthe set of functional dependencies Fi that hold true on Ri.