a$.$ Apply Min Max algorithm and fill the heuristic values for all the empty states in the game tree below.

b$.$ On the diagram above, indicate which states will not be explored if alpha$-$beta pruning is used. Circle all unvisited subtrees and indicate next to them whether alpha$-$pruning or beta$-$pruning was used by writing $\text{'}\text{'}$ or $\text{'}\text{'}$ next to the state. You may assume that the branches are explored from left to right.