Q$1.$ Consider a simple zero$-$sum game where two players take turns choosing numbers from a list $[5,3,7,10].[10$pts$]$ Players can pick only the first or the last number from the list. $$ Player $1($Maximizer$)$ tries to maximize their score, while Player $2($Minimizer$)$ tries to minimize Player $1\text{'}$s score. $$ Both players play optimally. Use the Minimax algorithm to calculate the optimal strategy for Player $1$ and determine the scores. Include the game tree and calculate the Minimax values for intermediate nodes. Start point is given: Represent the Problem as a Game Tree