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 lossless decomposition if the following set $F$

of functional dependencies holds:

$ABC$

$CDE$

$BD$

$E$ASuppose that we decompose the schema r$($A$,$B$,$C$,$D$,$E$)$ into r$1($A$,$B$,$C$)$ and r$2($A$,$D$,$E$)$ Compute the closure and canonical cover of the set of functional dependencies A $->$ B C C D $->$ E B $->$ D E $->$ A