Suppose that we decompose the schema R = (A, B, C, D, E) into (A, B, C)

(A, D, E). Show that this decomposition is a loss less-join decomposition if the following set F of functional dependencies holds:

A → BC

CD → E

B → D

E → A