Given the following relational schema where each attribute is atomic: PRODUCT (id, name, color, brand, country, price, year) and a set of functional dependencies: SetOfFDs = {price -> (id, name, brand, country), id-> name, (country, id, brand) -> (year, price),

name ->(id,colour)

 Find ALL candidate keys for the schema PRODUCT; show your work. GQ4) For each of the normal forms (1NF, 2NF, 3NF, BCNF), explain in detail why PRODUCT satisfies/does not satisfy with respect to the set of functional dependencies SetOfFDs. GQ5) Use the decomposition algorithm to obtain the lowest normal form that the schema PRODUCT does not satisfy with respect to SetOfFDs (for example, if your answer for the group question (GQ4) is that PRODUCT satisfies 1NF and 2NF, but does not satisfy 3NF and BCNF, then use the decomposition algorithm to decompose PRODUCT into the schemas each of which satisfies 3NF); show your work. For each resulting schema, give its complete set of functional dependencies and candidate keys. You must explain why each of your resulting schemas is in the desired normal form.