Consider the relation R={A,B, C, D, E}. The primary key of relation is {A, C}. Some additional functional dependencies are {B->E; C->D}. The relations after normalisation area.R(A,B), R2(A,E), R3(A,C), R4(C,D)b.R1(A,B,E), R2(A,C), R3(C,D)c.R(A,B), R2(B,E), R3(A,C), R4(C,E)d.R(A,B), R2(B,E), R3(A,C), R4(C,D)Clear my choice

Question: In the context of database normalization, assuming we have a relation schema R [A, B, C, D, E] and the following functional dependencies:{A} → {B, C}{B, D} → {E}{C} → {D}{D} → {A}Which operation can split the relation R into a higher normal form?

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

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...

Consider the relation R={A,B, C, D, E} with the dependencies: {A->D; AB-> C; D->E}.The relation is decomposed into R1(A, B,C) and (A, D, E). The decomposition isa.Non-Lossless joinb.Non-Lossless join and Dependency Presenrvingc.Non-Lossless join and non-Dependency Presenrvingd.Lossless join

The relation R(A,B,C,D,E,F) with functional dependency set F = {AB -> CD, C -> CA, B -> E, D -> B, E -> F}The number of candidate keys of a relation R is ______.