Can someone help me with this l?

2e 2. Adversarial Search (25 points) Consider the following game tree below 6 9482 5 39 11 12 5 9 B 1 8 a. Label each node with its minimax value. b. Determine which move would be selected by MAX? c. List the nodes that the alpha-beta algorithm would prune. (Assume the children of a node are d. In general (iLe, not just for the tree shown above), if we traverse a game tree by visiting visited from left-to-right) instead of left-to-right, can this result in a change to. i The minimax value computed at each root? ii The number of nodes pruned by the alpha-beta algorithm