3. Decomposition SKS 7.1: Suppose that we decompose the schema R = (A, B, C, D, E) into R1 = (A, B, C) and R2 = (A, D, E). Given the following set of functional dependencies: A + BC CD E B + D E + A 1. Show that this is a lossless decomposition. 2. Is this a dependency-preserving decomposition? Explain. 3. For each relation R, RI, and R2, is it in BCNF? 3NF? Briefly describe why or why not