$02.$

uppose that the schema R $($A$,$ B$,$ C$,$ D$,$ E$)$ is deconvosed into

$($A$,$ B$,$ C$)$ and $($A$,$ D$,$ E$).$ Considering the following set of FDs prove that

R in

the decomposition is lossless but not dependency presenting.

relation R$($A$,$ B$,$ C$)$ has FDs AB$->$C$,$