Question $3[2$ pts$].$ In the game tree showing in Figure $3,$ the root node $($node a$)$ is a Min node, and its two children $($nodes $b$ and $c)$ are Max 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.$

Mark nodes $($or branches$)$ which are pruned by the $-$ pruning method $(1$ pt$)$

Report final path of node a$\text{'}$s decision $(0\mathrm{.}5$ pt$)$