Functional Dependencies

Consider the following set F of functional dependencies on the relation schema r (A, B, C, D, E, F)
Part (a)
Compute B+?
Part (b)
Prove (using Armstrongs axioms) that AF is a superkey
Part (c)
Compute a canonical cover for the above set of functional dependencies F; give each step of your derivation with an explanation
Part (d)
Give a 3NF decomposition of r based on the canonical cover.