Compute all the non-trivial functional dependencies in the closure of the following set F of functional dependences for

[answerhappygod]

Compute all the non-trivial functional dependencies in theclosure of the following set F of functional dependences forrelation schema R = (A, B, C, D, E) in order to find the candidatekeys.
A-> {B,C}
{C,D}->E
B->D
E->A
Which of the following are candidate keys (minimalsuperkeys) for R? (mark ALL that apply to receivecredit)
Note: This question will be grade dividing the total pointspossible by the amount of correct answers for the question. Thisamount will be awarded for every correct answer selected anddeducted for every incorrect answer selected. No points will beawarded or deducted for correct or incorrect answers that are notselected.
Group of answer choices
A
B
C
D
E
B,A
B,C
B,D
B,E
C,D