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.

$1-$ How Many nodes are in the game tree$($ include terminal states$)$