The question tells you that for this instance, Lux chooses a lower-numbered store space than Jipp.

You also know from the first global rule that Hack chooses a higher-numbered store space than Jipp. You also know from the fourth global rule that Fisk must choose a lower-numbered store space than Jipp.

To sum that all up, Lux and Fisk must choose a lower-numbered store space than Jipp, and Jipp must choose a lower-numbered store space than Hack. This means that Hack must choose store space 4. It cannot choose store spaces 5 or 6 (based on the third global rule) and it needs to leave 3 lower-numbered store spaces open before it:

Lux/Fisk--Fisk/Lux--Jipp--Hack--5--6

For the first and second store spaces, it does not matter which order Lux and Fix go in.

Similarly, it does not matter what order Gourd and Mort go in for store spaces 5 and 6, since either way, Gourd will choose a higher-numbered store space than Lux (following the second global rule):

Lux/Fisk--Fisk/Lux--Jipp--Hack--Gourd/Mort--Mort/Gourd

Now we are looking for an answer choice that reflects an outcome that could be true. There is only one answer choice that reflects a possible outcome in the above scenario: Fisk chooses store space 1.

You can use your global rules to determine in which time slot Othello cannot give his speech.

The fourth global rule tells you that Othello must give his speech immediately before Paul gives his speech. This means that Othello can never give his speech fifth. Otherwise there would be no way for Paul to go immediately after him.

So your correct answer is fifth.

You can first map out that Fisk must be in a higher-numbered space than Lux:

L--F

Based on the fourth global rule, you also know that Fisk must be in a lower-numbered space than Jipp. You also know from the first global rule that Jipp must be in a lower-numbered space than Hack:

L--F--J--H

Even though the third global rule tells you that Hack must go in the first, second, third, or fourth space, you can actually narrow it to only the third or fourth spaces, because if it goes into the first or second space, there is no way for both Fisk and Jipp to go before it.

In this specific case, then, Lux, Fisk, Jipp, and Hack must fill the first, second, third, and fourth spaces, respectively. This leaves Gourd and Mort to fill the fifth and sixth spaces. Either arrangement will keep the second global rule of Lux coming before Gourd intact.

So, you will either have an arrangement of:

L--F--J--H--G--M

or

L--F--J--H--M--G

There is only one answer choice that gives an outcome that could be true with the two possible outcomes, which is: Mort chooses store space 5. All other options cannot be true with these restrictions.

The question is asking you to determine how many companies can only choose between two possible store spaces and still follow all rules.

From the previous question, you already determined that Hack can only choose either the third or fourth store space. The third global rule rules out the fifth and sixth spaces, and a combination of the first and fourth global rules rule out the first and second spaces.

Since Hack can only choose either the third or fourth store space, that also limits Fisk and Jipp to only two possible store spaces. Jipp can only choose store spaces two or three, so that Hack can go into a higher-numbered store space and Fisk can go into a lower-numbered store space. Taking that one step further, Fisk can only go in store spaces one or two, so that Jipp and Hack can both follow it.

Finally, Gourd can only choose either the fifth or sixth spaces. It cannot go in the first space, because that would not allow Lux to go into a lower-numbered space. It also cannot go into the second, third, or fourth spaces, because putting Lux ahead of it would throw off Fisk, Jipp, and Hack.

Therefore, four companies are limited to choosing only two possible store spaces. Not only is this valuable as the correct answer to this problem, but this is something you should hang on to while trying to answer subsequent problems.

The question tells you that Hack must choose the third store space. From the first and fourth global rules, you know that Jipp must choose a lower-numbered store space than Hack, and Fisk must choose a lower-numbered store space than Jipp. This means Fisk, Jipp, and Hack must choose store spaces 1, 2, and 3, respectively:

Fisk--Jipp--Hack--4--5--6

The fourth, fifth, and sixth store spaces will be chosen by Lux, Gourd, and Mort. There are a couple of possible arrangements for those three - the only restriction is that Lux must choose a lower-numbered store space than Gourd.

However, you determine your answer based on the Fisk--Jip--Hack arrangement. One answer choice speaks directly to that arrangement, which must always be true.

The correct answer is Jipp chooses store space 2.

This is an orientation question. The best approach to answering this question is to go through the rules one by one, and then eliminate the choices that violate any of the rules. The choice that remains is the correct one.

In sequence D, B, E, C, A, library B is the second library to get its delivery, but library E is not the fourth library to get its delivery. This violates the rule stating that if library B gets its delivery on day , library E gets its delivery on day Therefore, it can be eliminated. 

In sequence A, C, E, B, D, library E gets its delivery before library D, breaking the rule that states library E must get its delivery after library D. It can be eliminated.  

Sequence A, D, B, C, E violates the condition that states library E is not the last to get a delivery. It can be eliminated. 

Sequence C, D, A, E, B violates the rule that states library A must be either the first or last library to get a delivery. It can be eliminated.

To solve this problem, we need to think about how B and C can be as far apart as possible. We know they cannot occupy slots  and , because one of those slots must go to library A. Therefore it makes sense to think of B and C in either slots  and , or in slots  and . 

The rules tell us that D must get its delivery before E, which allows us to eliminate option A, C, E. Library E cannot occupy the first slot.

Library D cannot occupy the first slot if we want to schedule B and C for days as far apart as possible. We can therefore eliminate choice B,C,D and choice C, A, D, and A, B, D. 

The best approach to answering this question is to go through the rules one by one, and then eliminate the choices that violate any of the rules. 

Rule one, Cristina runs in a higher-numbered lane than Brianna, eliminates the sequence E,A,G,C,B,F

Rule two, Francis runs in either the sixth lane or the first lane, eliminates sequence B,F,C,E,A,G

Rule three, Amanda runs in neither the first nor the fifth lane, eliminates sequence F,E,B,G,A,C

Rule four, Gaby runs in a lane numbered two higher than Eli, eliminates sequence B,E,A,C,G,F 

Four of the answer choices in this question could be false, but only the correct choice must always be false.  The correct answer to this question is based on a fairly straightforward inference that you might have already made while diagramming. Since Gaby must run in a lane numbered two higher than Eli, Eli cannot run in the fifth lane. 

This is a conditional question, and it gives us new information. The best thing to do is to diagram the new condition and make additional inferences. 

If Eli is in the second slot, we immediately know Gaby must be in the fourth. Since Amanda can run in neither the first nor fifth slot, we know she must be in either the third or the sixth. 

Equipped with our new inferences, we can look at the answer choices. We are looking for an answer that can't be true, which means it MUST BE FALSE. 

The correct answer is that Cristina runs in a lower-numbered lane than Gaby; Gaby must run in lane , and Cristina can only run in either lane  or lane .