Question Type: Conditional
This question asks us to find the maximum possible number of spaces between the first J and the first H. Let’s think about what our diagram has to look like. Since we’re looking for the maximum, we know we want to use the full six slots. And if there are spaces before the first H, we know that J, not H, must be first and last _ in which case H will be fifth, to account for our HJ chunk. So far we have this:
Now, hold on. This is one of those moments that separates the good test-taker from the 170+ test-taker. The good test-taker might look at this diagram, see three spaces between J and H, and call it a day. But the 170+ test-taker knows to always follow the inference chain! To wit: since we have six slots, each letter must be used twice. So the latest the first H can occur is actually fourth. The remaining two slots must be occupied by L:
Look at that: a completed diagram! We’ve shown that no more than two spaces can come between the first J and the first H, so our answer is (C).