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

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}, R2={a,d}, R3={a,c,E} C. R1={a,b},R2={a,E}, R3={a,c}, R4={a,d}, R5={a,E}

D. R1={a,b,E},R2={a,b}, R3={a,c}, R4={a,d} E. none of the above