Q5

[christine.defenbaugh]

As this is a conditional question, our first task is to draw a new diagram with the conditional, and follow the inference chain. The question demands a 'could be true' response, so we must eliminate 4 rule violators.

If O is at stop 2, then O must also be at stop 4. Since no two consecutive stops may be the same, N must be at stop 5.

Again, since no two consecutive stops may be the same, N cannot be at stop 6, and O cannot be at stop 1. And since 1 and 6 must be the same, N cannot be at stop 1, and O cannot be at stop 6. O also cannot be at stop 3.



Rule violators
(A), (D), and (E) can all be eliminated for failing to have N at stop 5.
(C) can be eliminated as O cannot be at stop 6.

That leaves only (B). N-L is an acceptable list for stops 5 and 6.