Artificial Intelligence Problem: Please answer ALL PARTS OF THE QUESTION with FULL EXPLANATIONS. Thanks!

Problem 2.2 (15 points) Alpha-Beta Pruning Construct a tree with a branching factor of 3 at each level, and 81 leaves. This tree will represent two complete MAX-MIN pairs of moves. The top level of the tree is MAX; the next level (3 nodes) is MIN; the third level (9 nodes) is MAX; the fourth (27) is MIN; and the fifth (81 nodes) are the leaves of the tree, labeled with the following numbers, grouped in sets of 27, and reading from left to right: 837 259 538 257 948 632 495 172 246 147 842 578 246 956 102 453 927 317 956 401 345 123 734 432 827 193 273 As usual, MAX is trying to achieve the highest number; MIN the lowest. (a) What is the overall value of this tree to MAX