Consider a relation r(abcdefghilu) with the following set of functional dependenciesg = {f → ab, cd → e, c → fg, h → ij, d → h }1. is cde a superkey of r (wrt g)? 2. is cde a key of r (w. rt g)? 3. apply the appropriate algorithm to determine a key for r (w. rt. g) 4. apply the appropriate algorithm to determine all the keys for r (w. rt. g). 5. determine the prime attributes of r 6. is r in bcnf (w. r.t. g)? 7. is r in 3nf (w. r.t. g)? 8. determine whether the decomposition d cde, cfg, dh, hij, fab has () the dependency preservation property and () the lossless join property, with respect to g. also determine which normal form each relation in the decomposition is in.