16. Let R(A, B, C, D, E, F) be a relation schema, and let S = {A -> B, AB -> C, AC -> E, B -> CF, BC -> DE} be a set of functional dependencies. Use the Chase test to determine if the decomposition of R into the relation schemas R₁(A, B, E), R₂(A, D), R₃(B, D, E), and R₄(B, C, F) is lossless.
[Symbols: ->, \cup , \cap , ⊆, ⊂, in , ∉, ∅, −]