$($a$)$ Use the Minimax algorithm to compute the minimax value at each node for the game tree? Draw the tree with final values.$$ What is the value of the game to the max player?

$($b$)$ What first move should the max player make $($should move left or right$)?$

$($c$)$ Assuming the max player makes that move, what is the best next move for the min player, assuming that this is the entire game tree $($should move left or right$)?$