Time to wrap up Game 1 of the June 2007 LSAT. To answer question number 5, I'm going to once again lean heavily on the two worlds I made in my setup. Again, those look like this:
**World 1:
** 1 2 0/3 __ 3/4 (where the third spot and the fifth spot can EACH be 3, but they can't SIMULTANEOUSLY be 3).

**World 2:
** 2 4 0/1 __ 1/3 (where the third spot and the fifth spot can EACH be 1, but they can't SIMULTANEOUSLY be 1).

The question says "**Which one of the following must be true about any acceptable product code?" **This means the correct answer MUST always be true in not one but BOTH of the two worlds. Let's see:

A) There does not have to be exactly one digit between the 0 and the 1 in either World 1 or World 2, so there's no way this is the answer.

B) There are zero digits between the 1 and the 2 in World 1, and there does not have to be exactly one digit between the 1 and the 2 in World 2, so there's no way this is the answer.

C) In World 1, it's possible to have three digits between the 1 and the 3. This isn't possible in World 2, but that doesn't matter, since the correct answer has to be true in ALL cases. This is out because it doesn't have to be true in World 1.

D) In World 2, it's possible to have three digits between the 2 and the 3. This isn't possible in World 1, but that doesn't matter, since the correct answer has to be true in ALL cases. This is out because it doesn't have to be true in World 2.

E) Yep. In World 1, there are a maximum of two digits between the 2 and the 4. In World 2, there are zero digits between the 2 and the 4. Therefore, in both worlds, there are at most 2 digits between the 2 and the 4. So this is our answer.