<a> As A,B,D are not present ate the Right hand side of the given functional dependencies So this three attributes should include in the candidate key.Now find, closure(ABD)=ABDEFGHIJ.We see that closure(ABD) include all the attributes of the given relation.So ABD is the only key.(No other key possible you can check it.)
<b>As key attributes are A,B,D.So non-key atrributes are C,E,F,G,H,I,J.From the given set of functional dependencies the non-key attributes C,E,F,G,H,I are not fully functionally dependent on ABD.So we split the relation So that it can transform to 2NF.After spliting we get the following relation which are in 2NF---
R1(ABC),R2(BDEF),R3(ADGHJ),R4(AI).
<c>From the 2NF relation only R3 are not in 3NF others are in 3NF.Sowe split only relation R3.After spliting we get---
R3(ADGH) R5(HJ).
So all the relation are in 3NF { R1(ABC) R2(BDEF) R3(ADGH) R4(AI) R5(HJ) }