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

1) [4 points] Find all of the candidate keys of R.

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