(-00,00) (-00,00) (-00,00) 4-80,00) 3 2 -2 4 -5 3 10 -5 -12 1. [10 points] Using alpha-beta search, indicate which nodes are visited (with a checkmark) and, for every visited node, indicate the values of a and B and the value of the value variable (see the algorithm in the slides). 2. (10 points) If you could reorder the nodes (both the min nodes at depth 1 and the leaf nodes at depth 2), which arrangement would produce the maximum number of pruned nodes, and what is this number? Note: when you rearrange the nodes, you must respect the indicated connectivity. For in- stance, you can swap the order of leaves 2 and -2 in the leftmost min-node, but you cannot connect leaf node - 12 to a different min-node. (-00,00) (-00,00) (-00,00) 4-80,00) 3 2 -2 4 -5 3 10 -5 -12 1. [10 points] Using alpha-beta search, indicate which nodes are visited (with a checkmark) and, for every visited node, indicate the values of a and B and the value of the value variable (see the algorithm in the slides). 2. (10 points) If you could reorder the nodes (both the min nodes at depth 1 and the leaf nodes at depth 2), which arrangement would produce the maximum number of pruned nodes, and what is this number? Note: when you rearrange the nodes, you must respect the indicated connectivity. For in- stance, you can swap the order of leaves 2 and -2 in the leftmost min-node, but you cannot connect leaf node - 12 to a different min-node