Consider the following relation R(A,B,C,G,H) and functional dependencies F that hold over this relation: F = {A -> C, C -> B, AC -> GH, ABG -> H}

1)find all candidate key of R

2)Use the 3NF synthesis algorithm to find a lossless, dependency-preserving decomposition of R into 3NF.

Don't use any concept of 2nd NF.