Question 10

@MEIXOXT thanks for your message but I am not sure I am understanding your question here. The hypothetical that proves (C) is correct here is: F H L L P T As you can see here, H is not first. Hope that helps! Please let us know if you have any other questions.

I had the same question. When disproving B in the video, H was in the first position which goes against the rules. Would you be able to clarify why B is incorrect? I understand why C is correct but if I can't eliminate B I won't make it to C. Thank you!

I have the same question about B. It looks like while disproving B, there was a mistake or something wasn't clarified. Could you give clarification on the reasoning of why B is wrong?

@Meckena-Hultin and @Mariah-Bauguess, Happy to help. You're both right—H can't go in 1 in this scenario because there is only 1 P and it's in 5. If H is in 1, then there has to be a P in 6, so (A) is out. For (B), it helps if we refer back to the last few rules of the game. Recall that G - >F - >P - T P - >H - L So, if G is in, then F is in, and P and T are in, with P before T. If P is in, then H and L are in, with H before L. If we have exactly 2 Ts, then we are failing the P before T rule no matter what since there is only one spot after T. If this rule is failed, that means that both F and G are out (this is the contrapositive of G - >F - >P - T) /P - T - >/F - >/G If F and G are both out, then we're kicking more than one message out, so we wouldn't have enough messages to fill out the game board since we know that (B) tells us that T is the person with more than one message, so there are five people who left messages. Yet if T leaves exactly two messages, it forces F and G out, so there's no way it could be true that T left exactly two messages if the only message P left is the 5th message. Does this make sense? Let us know if you have any other questions!