Consider the game tree in the figure. Assume that a-8 pruning is used in the minimax algorithm, and that > Initially a = -00, B = too; > Children are evaluated in a pure random order. Q.6) Calculate the average number of leaf nodes the algorithm has to evaluate if the payoffs of the leaves are (left to right) 1, 0, 1, 1. Consider the game tree in the figure. Assume that a-8 pruning is used in the minimax algorithm, and that > Initially a = -00, B = too; > Children are evaluated in a pure random order. Q.6) Calculate the average number of leaf nodes the algorithm has to evaluate if the payoffs of the leaves are (left to right) 1, 0, 1, 1