Consider a relation schema (, , h, , , ) and a set of functional dependencies = { , h , h , h , h , h , }.

a) Is in the 3NF? If not, list all the functional dependencies in that violate the 3NF and explain why they are violations of the 3NF.

b) Use the 3NF decomposition algorithm to decompose , as necessary, into a collection of relation schemas that are in 3NF, and show your work. This means:

List all the keys for .

Find a canonical cover of , and explain the steps you took to generate it.

Complete the remaining steps of the algorithm, with explanation.

Show the final decomposition.