II$)$ Consider the alpha$-$beta pruning algorithm on this game

tree $($assuming the tree is explored in the usual left$-$to$-$

right depth$-$first order$),$ and in particular, consider whether

it is necessary to evaluate the last node on the right $($with

value $9).$ If x$=12,$ is it necessary to evaluate this last

node? Explain.