a While playing an adversarial game, a computer arrives at a situation with the search tree depicted below, where the payoff for reaching each leaf nodes is as indicated. Your move Ai Ag A2 Opponent's move 18 9 11 14 17 10 Which action would the minimax algorithm choose in this situation? To justify your answer, copy the tree into your answer book and indicate the i) payoffs for all the nodes. i) Indicate on your tree any nodes that would not be visited if the algorithm used alpha-beta pruning. Explain your answer a While playing an adversarial game, a computer arrives at a situation with the search tree depicted below, where the payoff for reaching each leaf nodes is as indicated. Your move Ai Ag A2 Opponent's move 18 9 11 14 17 10 Which action would the minimax algorithm choose in this situation? To justify your answer, copy the tree into your answer book and indicate the i) payoffs for all the nodes. i) Indicate on your tree any nodes that would not be visited if the algorithm used alpha-beta pruning. Explain your