Consider the game tree below. Run the minmax with alpha$-$beta pruning algorithm on this tree starting from state A $($expanding nodes left to right; starting player $($blue upturned triangle$)$ is the maximizing player$).$ Answer the following questions.

Question $9$

$\frac{0}{2}$ pts

What is the value of beta at state $B$ when it calls its value function, which would be max$\_$value$(F,$ alpha$=?,$ beta$=?).$ Enter the exact number, or $-1000$ for $-$Infinity; $1000$ for $+$Infinity.

Question $10$

$\frac{0}{2}$ pts