Consider the following game tree in which the evaluation function values are shown inside each leaf node. Assume that the root node corresponds to the maximizing player. Assume that the search always visits children left$-$to$-$right.

$3$A $[6\%]$ Compute the backed$-$up values using the minimax algorithm. Write your answers inside each node $($square box$).$

$3$B $[8\%]$ Which nodes will not be examined by the alpha$-$beta pruning algorithm? Show your answer by circling all the nodes $($or circling the entire subtree when appropriate$)$ in the tree that will be pruned.

$3$C $[6\%]$ If the MINs and MAXs in the given graph are reversed, which means the top node is MIN, how many nodes will not be examined by the alpha$-$beta pruning algorithm? Answer with a number.