Consider the following min-max game tree Execute alpha-beta pruning on the example, write the minimax value at each node, and cross out the branches that get pruned by the algorithm. If a branch does get pruned, circle the nodes under that branch that you had to explore in order to decide to prune the branch. How would you reorder the first moves that max makes in order to improve alpha-beta pruning