normalisation

Question

Consider the following relation R(ABCDE) with FD's F

{

  A$\rightarrow$BC

  CD$\rightarrow$E

  B$\rightarrow$D

  E$\rightarrow$A

}.

How many minimum relations are required to decompose into BCNF with lossless join and dependency preserving?

Please explain briefly.

Comments

$BD \left ( B \rightarrow D \right )$

$ABCE \left ( A \rightarrow BCE, \ E\rightarrow BCA \right )$

$CDE\left ( CD \rightarrow E \right ) $