Consider the following set F of functional dependencies on the relation schema r (A, B, C, D, E, F)
A --> BCD
BC --> DE
B --> D
D --> A

Part (1)
Compute B+
Part (2)
Compute a canonical cover for the above set of functional dependencies F
Part (3)
Give a 3NF decomposition of r based on the canonical cover
Part (4)
Give a BCNF decomposition of r using original set of functional dependencies.
Part (5)
Can you get the same BCNF decomposition of r as above, using the canonical cover?