We have the attributes: {A, B, C, D}.Consider the following functional dependenciesA, B, C -> DA, C -> BB -> A, C, DA, B -> C, DA -> DFind all minimal keys.

Minimal keysWe have the attributes: {A, B, C, D}.Consider the following functional dependenciesA, B -> CA, C -> BB, D -> A, CA, B, D -> CC -> A, DFind all minimal keys.Write one minimal key per line and the attributes separated by commas. For example, like:{A,B}{B,C,D}

We have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesB, E -> C, D, FA, G -> B, CA, F -> B, DF, G -> ED, E -> A, B, GD, E -> A, BThe first step in computing the normal form, is to derive a canonical (minimal) set of functional dependencies. We have already done this first step for you. The following is a set of canonical functional dependencies (for the dependencies shown above):B, E -> DD, E -> AA, F -> DA, F -> BA, G -> BB, E -> FF, G -> EA, G -> CD, E -> GApply the synthesis algorithm to derive a Boyce-Codd normal form for the relation R(A, B, C, D, E, F, G).Write your answer as followsFunctional dependencies: write one dependency per line, for exampleA,B -> CB,C,D -> A,FSplitting steps: write one split per line, for examplespliting R(A,B,C,D) into S(A,B,C) and T(A,D) -- the relation names are not importantspliting (A,B,C) into (A,B) and (A,C) -- and can even be omitted...

Functional dependencies: implicationWe have the attributes: {A, B, C, D, E, F, G}.Consider the following functional dependenciesA, D, F -> EE, F, G -> DA, B -> FE -> BC, G -> D, FC, G -> B, EA, C -> EA -> C, EMark all functional dependencies that are implied by the dependencies above:A, C -> EA, C -> BA, C -> B, DA, C -> CA, C -> C, F

Consider a relation with seven attributes ABCDEGH. The following dependencies are given:AB -> C, AC -> B, AD -> E, B -> D, BC -> A, E -> GWhat is the key?

Consider relation R(A,B,C,D,E) with functional dependencies:D -> C, CE -> A, D -> A, AE -> DWhich of the following is a key?CDEABCECE