Describe and illustrate the process of normalization for the following relation to Second (2NF), and Third (3NF).

R(ABCDEF)

A→B
D→E
B→C
E→F

to place this in 2NF we see that E and F is depended on D.
and B and C is functionally depended on A.
So you would have tables:

R(ABC)
R(DEF)

which leaves in in 2NF, because none of D, E or F is depended on A.

To place this now in 3NF we have to eliminate transitive dependencies. This is A->B->C thus C is transitively dependent on A since A NOT -> C.
When eliminating these you just split it up further and have resulting database in 3NF:

R(AB)
R(BC)
R(DE)
R(EF)