QUESTION $1$B $-1\%$

In the minimizing and maximizing nodes below, fill in the values in all internal nodes represented by triangles by applying minimax algorithm. Please note that blue triangle $($facing upwards at levels $1$ and $3)$ is your maximizer and the orange triangle $($facing downwards at level $2)$ is your minimizer.

QUESTION $1$ C $-1\%$

Now assume the standard left$-$to$-$right tree traversal, cross off any nodes that will not be evaluated when alpha$-$beta pruning:

QUESTION $1$D $-0\mathrm{.}5\%$

Fill in the values in all the internal nodes including the chance nodes.

QUESTION $1$E $-0\mathrm{.}5\%$

What is the value of the game for the maximizer node in $1$D$?$