3. For the universal relation R(A, B, C, D), consider the decomposition D consisting of R1(A, B) and R2(B, C, D), and the set F of functional dependencies { A-> D B A,C DAB. a. Compute the projection of F on Ri. b. Compute the projection of F on R2 c. Does the decomposition D preserve the set of dependencies F? Give a detailed explanation why or why not. (That is, don't just repeat back the definition of the dependency preservation property, but rather show why the decomposition D either has or does not have this property.)