UESTION 27 Consider the game tree below in which the first player is trying to maximize his score and the number at the leaves are the values returned by a static evaluator for the board positions reached. (Max) (Min) (B) (C) (Max) TAT 3 5 1 5 7 3 & 2 5 7 62 9 8 S 6 9 074 9 8 a. For each box write the value returned by the standard Minimax algorithm. [1 x 3 = 3 (each level one mark)] b. Which node represents the best initial move for the first player: [0.5 mark] c. In the copy of this game tree below, for each box write the value returned by the standard Alphabeta algorithm, if the tree is processed from left to right, and write which leaves (branch numbers) that need not be examined or considered [1.5 marks]