Please answer the following:Use the partial game tree below to answer this question.

a$)$ Apply the minimax algorithm to the partial game tree above, where it is the

maximizer's turn to play and the game does not involve randomness. The values

estimated are indicated in the leaf nodes $($higher scores are better for the maximizer$).$

Write the estimated values of the intermediate nodes inside their circles, and indicate the

proper move of the maximizer by circling one of the root's outgoing arcs.

b$)$ Are there any nodes in the above game tree whose score need not be examined and

could be pruned?.