Consider the game tree in Figure 4 and then answer the questions that follow. (The static utility values for the leaf nodes are provided below each leaf node, and node A is a MAX node.) Figure 4: Game tree a) Provide the backed-up utility values for all the non-leaf nodes in the tree if a minimax search is performed. b) Suppose that alpha/beta pruning is applied during the search. Write down the and values associated with nodes B,E,F and G (after the search completes). NB: Write down the node as well as the and values for that node. c) Is there any benefit in applying alpha/beta pruning to this search? Justify your answer. (3)