Consider the following game tree: MAX MIN MAX E B F G H K L M N MIN 10 MAX S T U V W X 3 5 27 AA BB 8 9 D P R Y Z 12 3 a) b) Apply the minimax algorithm on the game tree above to find the utility values at the nodes A, B, C, D, E, F, H, J, K, L, N, R and X. Based on the values found, state the best possible move from node A. (5 Marks) Apply alpha beta pruning algorithm on the same game tree. List all the nodes whose values need not be calculated as their branches would be pruned off. Moreover, show the progression of all alpha and beta values at all the nodes. (10 Marks)