Assume you have the following search tree for an adversarial game, calculate the following: A) The utility value for each node using the mini-max algorithm. Describe the sequence of nodes that you...

Assume you have the following search tree for an adversarial game, calculate the following:

A) The utility value for each node using the mini-max algorithm. Describe the sequence of nodes that you will work with. Show the final values at the root and the intermediate notes.

B) Apply the alpha-beta pruning algorithm. Illustrate which nodes/branches will be pruned. Calculate the utility values for the intermediate nodes. What is the difference between the values in part b and part a?

C) For a general game tree (i.e., not limited to the above tree), are there any cases that the AlphaBeta algorithm gives a different value at the root node than the Minimax algorithm? If yes, show an example; if no, just say no.