Alice and Bob play the following game with \( S=\{1,\dots, 777\} \).

Alice picks a number \(x \in S\) without telling anyone and Bob will guess what the number is at the end of the game. Alice is malicious so that she can always change her number \(x\) at any time until the end of the game.

In each round, Bob picks a subset \(T\subseteq S\) and asks a following question to Alice: “is your \(x\) belong to \(T\)?” Alice must say either Yes or No. At the end of the game, Bob guesses her \(x\) first and then Alice reveals her number \(x\) (Alice can still change her number after she listen to Bob’s guess and before revealing her number). According to her final number \(x\), each of her previous answers are determined to be either a truth or a lie.

Bob wins if Alice end up lying more than three times or his answer is correct. Alice wins if Bob’s answer is wrong and at most three of her answers are lies. Prove that if a game consists of twenty rounds, then no matter what Bob does Alice can always win.

Let \(S_g\) denote the closed orientable connected surface of genus \(g\). Suppose we glue triangles along the edges so that the resulting space is \(S_g\) and the intersection of any two triangles are either empty or a single edge. Let \( n(g) \) be the minimum number of triangles one needs to make \(S_g\) while satisfying the above rule. What are \( n(1), n(2), n(3) \)? Does the limit \( \lim_{g \to \infty} n(g)/g \) exist?

Consider the cards with labels \( 1,\dots, n \) in some order. If the top card has label \(m \), we reverse the order of the top \( m \) cards. The process stops only when the card with label \( 1\) is on the top. Prove that the process must stop in at most \( (1.7)^n \) steps.