Consider the universal relation R = {a, b, c, d, E} and the set of functional dependencies FD = {{a} {b,c},{b} {d}} and MVD = {{b} {c,d}

a. Write all the candidate keys for R.

b. What schema(s) would be produced by the 4NF decomposition algorithm?

A. R1={a,b,c,d, E}

B. R1={a,b,c}, R2={b,d}, R3={a,E}

C. R1={b,c}, R2={a,b}, R3={a,d}, R3={a,E}

D. R1={b,d}, R2={b,c}, R3={a,b}, R3={a,E}

E. none of the above