3. Given the relation R(A, B, C, D, E, F, G, H, I, J) and the function dependencies

FD1: A --> E

FD2: {A, B --> {C, D}

FD3: {F, G} --> A

FD4: {A, F} --> G

FD5: G --> {H, I, J}

3b. Identify all candidate keys using either the synthesis OR decomposition method. Show each step.

Candidate key(s):

3c. Is the relation in 2NF? _____

3d. Why or why not?

3e. Write the relation(s) in 2NF here, the FDs, and candidate keys for each relation. If already in 2NF, just write the relation:

3f. Are the relation(s) you provided in question 3e in 3NF? ______

3g. Why or why not?

3h. Write the relation(s) in 3NF here, the FDs, and candidate keys for each relation. If already in 3NF, just write the relation(s):