QUESTION 3 For the given game tree, what will be the calculated heuristic cost at the max player A using the min-max algorithm with alpha-beta pruning. Also, which nodes will be pruned as a result of employing alpha-beta pruning? Assume square represents the MAX players and circle represents the MIN players. A B D K OM M N o 6 5 8 10 21 15 18 O Max player A heuristic cost = 6, pruned nodes are K, G Max player A heuristic cost = 2, pruned nodes are J, O O Max player A heuristic cost = 6, pruned nodes are J, O O Max player A heuristic cost = 8, pruned nodes are I, M, O O Max player A heuristic cost = 18, pruned nodes are D, E, F QUESTION 4 Given the state-space graph below with initial state as A, indicate the order in which the nodes are expanded for a Uniform Cost algorithm to reach the Goal state G, and the cost value at Goal state G. For a tie- breaker between nodes with the same cost, expand the node with the lower alphabet first. D G O ABCE G(14) O ABDCEF G(8) O ADF G(8) O ADCBEF G(10) O CBAAEF G(22)