Question

Consider an example of a minimax tree $($game tree$)$ with the following structure $($values in

parentheses are the heuristic evaluations$)$ where Alpha$-$Beta pruning is applied to demonstrate

which branches of the tree will be pruned. As an expert in Adversarial search, by providing concise

information and steps where applicable provide a pruned tree

Note that.. the root node is the MAX level and the leaves from the root node forms the

MIN level