I had no idea how to approach this question, could someone explain please?

This is a "must be true" question with no Stem Rule, so it's really open-ended. I'm sure that's the reason you were at a loss for how to tackle it.

This question is really asking "which of these answer choices, if not true, would create a rule violation?". What makes this question slightly easier is the fact that it's the last question for this game, so you should know the rules pretty cold.

One thing to keep in mind here is that you SHOULD NOT just start guessing and checking EACH CHOICE. That will take forever in the case of a "must be true" question. On your first pass through the answer choices, concentrate on trying to find an answer choice that clearly "must be true".

So let's start by looking at answer choice "A":
Would this statement result in a rule violation if it were not true? Doesn't seem like it. Let's move on, and we'll come back if need be.


How about choice "B"?:
Seems like M could come 1st and 4th. You could test this, or just come back if need be.


Choice "C":
We can prove this answer choice wrong pretty easily--we'd just have to create a sequence with three G's (keeping in mind that it must also have M x2 and T 7th).

Let's try:
G, M, G, J ! ! ! ! this won't work, because J cannot be 4th.

Let's try again:
G, J, M, G, M, G, T

Okay, so we can strike choice "C".


Now, how about "D"?:
We know that if the ship goes to J, it must go to G first. This answer choice says that it "must be true" that the ship can visit J twice AT MOST.

To test to see if this answer choice "must be true", let's see if the ship can go to J three times:

If you have J x3, you must have [G, J] x3.

But we also must have M x2.

And T must be 7th.

That's 9 places for the ship to visit, but our sequence only has 7 slots.

Therefore, "D" must be true.

There's no need to check "E", and there's no need to go back to "A" or "B".

What about E though? Must it not also be true? Is there more than one right answer to this problem?

If we can create a sequence with three T's, then we know Choice "D" is wrong.

Let's start by sticking T is slot 1 (in addition to slot 7, where we know it must go):

T, __, __, __, __, __, T

Now, we know we've got to stick M..G..M in here, along with [G, J].

Can we do that?
T, M, __, G, J, M, T

Notice that we've avoided sticking J in slot #4.

As a final step, we can stick T in the open slot shown above.

Since we've got T x3, you can strike Choice "E".


Worth Noting:
Logic Games will NEVER have two correct answers.

The way I approached it was J was Dependent on G so that killed 6 spots out of 7. 2 M's that are mandatory would be impossible.