For a relation R(A,B,C,D,E), we propose a decomposition R into the three relation schemas: R₁(A,B,C), R₂(B,C,D), and R₃ (A,C,E). For each of the following sets of FD's that hold on R, use the technique discussed in the class to (i) prove/disprove the proposed decomposition is lossless, and (ii) determine whether or not, the proposed decomposition is dependency-preserving.
- A→D,D→E, and B→D