If I have relation schema R(A, B, C, D, E) with functional dependencies: AB->C, CD->E, C->A, E->D:
a)find all the (minimal) keys for R
b)state the normal form for R and describe functional dependencies that violate higher NF
c)decompose R into 2 (or more) relations that are in highest possible normal form (if possible) and give for each relation of your decomposition a minimal basis for the FD that hold in these relations

I hope you don't expect us to do your homework. If you need help with something, show effort and ask for help/guidance instead of the solution.

Typical homework problem.
First, you have to attempt it according to what you learned in class.
Then we might offer advice.

This article has been dead for over six months. Start a new discussion instead.