BASED ON GIVEN CONCEPT, PLEASE ANSWER QUESTIONS AT THE BOTTOM

Suppose you have a sequence of coins, each with a value. Let the number of coins be even. You play a game as follows: You and an opponent take turns taking a coins at either end, until no more coins are left. You start. The winner is the player with the higher sum total. Notation: Vi] is the value of coin i and M[i, i] is the maximum you can have. We assume that the opponent is equally smart, and also wants to maximize the value. (And when your opponent picks the coin that maximizes the score, then you are left with the min. The driving equation: 0 if j