In the following tree, fill in the Minimax values for the internal nodes using the given values at the leaves.

$($b$)$ Perform Alpha$-$Beta pruning twice on this tree, first assuming left$-$to$-$right node expansion, and second assuming right$-$to$-$left node expansion. In this tree, the root node is the maximizer player.