Hi Doreen - no worries, I'm sure we can clear this up in a jiffy. In my explanation below, I'll assume that you and other readers are also looking at Noah's diagram as posted in this forum for the same game (
preptest-40-section-2-g2-a-study-sponsored-by-a-consumer-t210.html).
First, let's consider the constraints you highlighted.
Constraint 4: H ranks better than G *if* both are tested.
Constraint 5: K ranks better than F *if* both are tested.
Conditional constraints can be particularly challenging, because you don't quite know how or where to fit them into the diagram. Here, the thing to remember is that these constraints *only* matter if both of the elements are indeed tested. That said, in this particular game you get an unusual amount of mileage out of these conditional constraints because to some extent they control what is and is not tested. For example, when G is tested first (one of our frames) then we know given that G is first AND that if G and H are both tested H ranks better THAT G cannot be tested - it would simply be impossible to meet all those constraints at the same time. Similarly when F is first (the other frame) then K cannot be tested because it could only be tested if it ranked higher than F - which it cannot when F is first.
Does that make sense?
Now let's look at question # 8. You said you thought (B) could be the answer, so let's check it out. Does G have to be among those tested? No, in fact if we go to the 2nd frame, where H is first, as above, we explicitly know that G cannot be tested.
I have a feeling your other questions probably stem from misunderstanding this constraint, so I won't post solutions just yet for those individual problems. Please let me know if this clears it up or if you'd like me thresh it out a bit more!