Below is a partial game tree, where it is the maximizer’s tu…
Below is a partial game tree, where it is the maximizer’s turn to play, and the game does not involve randomness. Maximizer nodes are represented by red circles, minimizer nodes by blue circles, and terminal nodes by blue squares. The utility value for terminal nodes is provided inside them, and higher scores are better for the maximizer. Apply the alpha-beta pruning algorithm while expanding deeper nodes first and breaking ties from left to right to discover which nodes can be pruned. Provide a list of pruned nodes as your final answer (e.g., ). For terminal nodes, use numbers 1 to 8, with 1 representing the leftmost node and 8 being the rightmost one.