Consider the universal relation R = {a, b, c, d, E} and the set of functional dependencies FD = {ab → c; c → d; ad → E; d → bE}. 1. Give the key(s) of R. 2. What schema(s) would be produced by the 3NF decomposition algorithm? A. R1={a,b,c,d,E} B. R1={a,c,d}, R2={b,d,E} C. R1={a,b,c}, R2={c,d,E} D. R1={a,b,c}, R2={b,d,E} Justification for why choice A is/isNot in 3NF: Justification for why choice B is/isNot in 3NF: Justification for why choice C is/isNot in 3NF: Justification for why choice D is/isNot in 3NF: 3. With reference to your answer to the previous question: Are (Is) the above 3NF decomposition(s) in BCNF? If yes, explain. If no, divide into BCNF.