Decompose Relation R(ABCDE) in 2nf and 3nf Given relation R(ABCDE) with functional dependencies

A->C
B->D
AB->E
Given: AB is the primary key.

I know that this relation is in 1NF because of partial dependencies A->C and B->D

Now how I decompose it to get 2NF or better form.
My concepts are weak , so please help me.
The following two FD's violate 2NF:

A-&gt;C
B-&gt;D


We can create new relationships based upon those FD's: (AC;A-&gt;C), (BD;B-&gt;D), (ABE;AB-&gt;E).  This set of relationships now satisfies 2NF (and also 3NF and BCNF).