For relation R=(L, M, N, O, P), the following dependencies hold and R is decomposed into R1 = (L, M, N, P) and R2 = (M, O). How to calculate what candidate keys are there for relation R1 and R2. Please tell me the algorithm.
FD's are $M\rightarrow O, NO\rightarrow P, P\rightarrow L, L\rightarrow MN$