$($a$)$ Consider the following game tree.

$1.$ What is the minimax value at node A$?$ Assume MAX plays first?

$2.$ Which branches will be pruned after running minimax search with alpha$-$beta pruning?

For instance, if the edge between node A and node B is pruned, write A$$B

If the edge between H and $3$ is pruned, write H$3.$

List the pruned branches from left to right.

If a branch from an upper level is pruned, you don$$t have to list the branches below that.