Perform the alpha-beta pruning on the tree below. MAX player wants to maximize value while Min player wants to minimize value. Use the cutoff test a>=. 1) Indicate which branches are pruned (cross out those branches). [3 marks] 2) What is the value of this tree (Max players value at the root node)? [1 mark] 3) Show the best move/path on the tree.

MAX MIN MAX 7 2 9 8 11 1 3 6 12 5 10 4