Consider the following game tree, where one of the leaves has an unknown payoff, x. player 1 moves first, and attempts to maximize the value of the game. each of the next 3 questions asks you to write a constraint on x specifying the set of values it can take. specify your answer in one of the following forms: write all if x can take on all values write none if x has no possible values use an inequality in the form x< {value}, x> {value}, or {value 1}16. note that the answer check is sensitive to ordering, spacing, and capitalization, so do not use spaces in your answers and make sure the form matches the examples above.