4. Let R(ABCDEG) be a relation schema and let the set of functional dependencies satisfied by R be F={AB CD, BCD A, B C, ED). (4.1) Compute a minimal cover of F. Show the steps in your computation. 4.2) Compute an LLJ BCNF decomposition of R. Is possible to get a BCNF decomposition for the relation R which is both LLJ and fd-preserving? Show your decomposition tree, and the fd's used in each decomposition step. Moreover, for each relation R, at a leaf node in the tree, show the set of functional dependencies F, that hold true on R 5. Let R(ABCDE) be a relation schema and let the set of functional dependencies satisfied by R be (5.1) Compute a minimal cover of F. Show the steps in your computation. (5.2) Compute an LLJ and fd-preserving 3NF decomposition of R. Show the intermediate steps in answering this