Consider the schema R = (A, B, C, D, E) and let the following set F of functional dependencies holdforR:

F = {A -> BC, CD -> E,C -> A, B -> D}

Q: Suppose that the schema R = (A, B, C, D, E) is decomposed into R1 = (A, B, C) and R2 = (A, D, E). Show if this decomposition is a lossless decomposition with respect to the given set of functional dependencies F.

Q: Give a lossless, dependency-preserving decomposition into 3NF of schema R.