Given a game tree as follows, where the rectangle block represents you (Max) and the circle block represents your opponent (Min). Perform a- B pruning on this game tree, where the tree is expanded from left to right. Question: Label the backtracking values and pruning results (label them by x) at the corresponding positions in the graph. Then explain the final goal of the computation