Which algorithm is used to compute the closure of a set of attributes under a given set of functional dependencies?a.Armstrong's Axiomsb.Dependency Preservation Algorithmc.Attribute Closure Algorithmd.Transitive Rule Algorithm

. What is the closure of the attribute set? Support the answer by describing the algorithm and suitable example. Mention the applications of the algorithm.

Consider a relation, R (A, B, C, D, E) with the given functional dependencies;  A → B, B → DE and D → C. What is the closure (E)?Question 2Select one:a.E+ = DECb.E+ = DEc.E+ = BEd.E+ = E

b. Given a table with attributes A, B, and C, can you determine the functional dependencies that hold within the table based on a set of example data?

In the context of functional dependencies, what does the term "transitive rule" refer to?a.A rule for inferring new functional dependenciesb.A rule for enforcing referential integrityc.A rule for determining superkeysd.A rule for determining candidate keys

Properties of RelationalDecompositions (3) Dependency Preservation Property of aDecomposition: Definition: Given a set of dependencies F on R,the projection of F on Ri, denoted by Ri(F) whereRi is a subset of R, is the set of dependenciesX  Y in F+ such that the attributes in X υ Y are allcontained in Ri. Hence, the projection of F on each relationschema Ri in the decomposition D is the set offunctional dependencies in F+, the closure of F,such that all their left- and right-hand-sideattributes are in Ri.