John and Anna play the following version of the Rock, Paper, Scissors game. Peter always loses when playing Scissors, but as compensation, receives a payoff of c = [0, 2] if both him and Ida play Paper (the value of c is fixed and known by both players). The corresponding game is represented by the following game table: John Anna RPS R 0,0 -1,1 1,-1 P 1,-1 C,-C -1,1 S -1,1-1,1 | -1,1 What is the maxmin and minmax values of this game. Does the game admit a value? What is the outcome of iterative elimination of strictly dominated strategies. What is the value of the game in mixed strategies.