5. (25 points) Consider the game tree in Figure GT-1 which il lustrates the possible moves, to a depth of 4 that can be made from the current position (at the root) in a hypothetical game between a computer and a human. The evaluation function is such that the computer seeks to maximize the score while the human seeks to minimize it. The static value of each leaf node appears below the node. max min K max 4 -2 1 Figure GT-1. A hypothetical game tree. a. In the box value. at each non-leaf node in the figure above, write the appropriate minimax b. What is the best move for max to make? c. What do the leaf nodes represent? 5. (25 points) Consider the game tree in Figure GT-1 which il lustrates the possible moves, to a depth of 4 that can be made from the current position (at the root) in a hypothetical game between a computer and a human. The evaluation function is such that the computer seeks to maximize the score while the human seeks to minimize it. The static value of each leaf node appears below the node. max min K max 4 -2 1 Figure GT-1. A hypothetical game tree. a. In the box value. at each non-leaf node in the figure above, write the appropriate minimax b. What is the best move for max to make? c. What do the leaf nodes represent