Consider a relation schema R(c,t,h,r,s,g) and a set of functional dependencies F={ct,hrc,hrt,htr,hsr,chr,csg} a) Is R in the 3NF ? If not, list all the functional dependencies in F that violate the 3NF and explain why they are violations of the 3NF. b) Use the 3NF decomposition algorithm to decompose R, as necessary, into a collection of relation schemas that are in 3NF, and show your work. This means: - List all the keys for R. - Find a canonical cover of F, and explain the steps you took to generate it. - Complete the remaining steps of the algorithm, with explanation. - Show the final decomposition