Consider a row of n coins of values v1-vn where n is even [since it’s a two player game]. We play this game with the opponent. In each turn, a player selects either the first or last coin from the...

Consider a row of n coins of values v1-vn where n is even [since it’s a two player game]. We play this game with the opponent. In each turn, a player selects either the first or last coin from the row, removes it from the row permanently, and receives the value of the coin. Determine the maximum possible amount of money we can definitely win if we move first.