As this is a conditional question, our first task is to draw a new diagram with the conditional, and follow the inference chain. The correct answer must be true, while 4 incorrect answers are breakable.
As O is in stop 5, it cannot be at stop 4 or 6 (as no two consecutive stops can be the same). And since 4 must match 2, and 6 must match 1, O similarly cannot be at stops 1 or 2.
With L out of rotation for this question, we know that stops 1 and 2 must contain M and N. However, we know that M cannot go right before N. So N must be in stop 1, and M in stop 2.
Since 1 and 6 must match, N is also at stop 6; since 2 and 4 must match, M is also at stop 4.
Stop 3 must be O, as the 'no two consecutive' rule bans M, and the 'never MN' antichunk bans N.
Check out the diagram!
We've locked in everything, and stops 1-3 must be N-M-O. Answer (C) is correct!