Consider primary key based normalization only. Given a relation R(A, B, C, D, E, F, G, H, I, J) with primary key AB, and the set of functional dependencies (FDs)

AB->C, A->DE, B->F, F->GH, D->IJ
a. Is this relation in primary key based 1NF, 2NF, or 3NF? Justify your answer.

1NF: Yes/No, justify:
2NF: Yes/No, justify with all possible FDs

3NF: Yes/No, justify with all possible FDs

b. Apply primary key based normalization successively until you reach 3NF or you cannot decompose the relations further (e.g., n NFàn+1 NFà...). For each normalization step, list all the resulting relations, underline the primary key for each relation, and state the reasons behind each decomposition (e.g., remove ... problem).