Need help with number 1 thank you so much.

1. Consider the following 3-level game tree with e-values on the leaves as shown: A+ B- D- E+ F+ G+ H+ I+ J+ K+ 7 6 8 5 2 3 0 -2 6 2 5 8 9 2 a) Using a minimax evaluation, which next move should the first player (+) choose? b) If an alpha-beta search (using a DFS with a left-to-right expansion of successors) is used instead, which nodes would not have to be expanded/evaluated? c) If an optimal alpha-beta search (DFS with an optimal expansion of successors) is used instead, which nodes would not have to be expanded/evaluated? 1. Consider the following 3-level game tree with e-values on the leaves as shown: A+ B- D- E+ F+ G+ H+ I+ J+ K+ 7 6 8 5 2 3 0 -2 6 2 5 8 9 2 a) Using a minimax evaluation, which next move should the first player (+) choose? b) If an alpha-beta search (using a DFS with a left-to-right expansion of successors) is used instead, which nodes would not have to be expanded/evaluated? c) If an optimal alpha-beta search (DFS with an optimal expansion of successors) is used instead, which nodes would not have to be expanded/evaluated