Question $2[4$ pts$].$ In the game tree showing in Figure $2,$ the root node $($node a$)$ is a Max node, and its two children $($nodes b and c$)$ are Min nodes. Other layers are marked respectively using Max and Min notation to the right of the figure.

Report utility values for each node $($i$.$e$.,$ nodes $a,b,$dots,$o(1$ pt$).$

Mark nodes $($or branches$)$ which are pruned by the $-$ pruning method $(2pts$

Report final path of node a$\text{'}$s decision $(1$ pt$)$