Consider the following game tree, where the letter next to the node is the name and the number below the node is the minmax value if any.

What are the values of the MAX and MIN nodes? No pruning is used here.

Cross out the node$($s$)$ whose exact value$($s$)$ the alpha$-$beta pruning method never determines, assuming that the right child is added to the frontier first and the left child

is expanded or returns utility $($if terminal node$)$ first.