Remember that the Pumping Lemma is a theorem that holds for every regular language L. It has the quantifier structure, BEL (+). This is equivalent to say that if the corresponding statement with quantifier structure A & (-) holds, then L is not a regular language. In this problem, you play a quantifier game. You are given a language L. You have to figure out whether L is regular or not. If L is regular, then the Pumping Lemma holds for L. This means, you have a winning strategy in the quantifier game (+). You play it against Automata Tutor, your adversary. If you play well, you win.