1. Let relation R(a,b,c,d,E) satisfy the following functional dependencies: ab c, bc d, aE b, dE a, cd E

1a. (2) Which of the following FDs is also guaranteed to be satisfied by R? A. c a B. ab E C. bd E D. aE d

1b. (2) What is/are the keys for R? A. ab B. aE C. acd D. bc

1c. (4) What schema(s) would be produced by the BCNF decomposition algorithm? A. R1={a,b,c,d,E} B. R1={a,b,c,d}, R2={c,d,e}, R3={a,d,E} C. R1={b,c,d}, R2={c,d,e}, R3={a,d,E} D. R1={a,b,c}, R2={a,d,E},R3={b,d,E}