Q$3)(20$ pts$)$ Games

Consider the game tree below. The nodes shown in rectangles are already computed for you,

$($a$)(5$ pts$)$ Fill in the remaining values for the internal nodes and show on the figure which path should MAX choose

$($b$)(15$ pts$)$ Which nodes could be cut off via alpha$-$beta pruning. Cross out the nodes for which values will not be computed. On the tree show the cut$-$offs on the edges and indicate whether it is alpha cut$-$off or beta cut$-$off.