Consider the following game tree. Assume it is the maximizing players turn to move. The values at the leaves are the static evaluation function values of the states at each of those nodes.

$1.$ Label each non$-$leaf node with its minimax value.

$2.$ Apply the alpha$-$beta algorithm to the above tree. Assume children of a node are visited left to right.