Please help answer the question in the screenshot. Thanks!

This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts and crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly nX 's and no O 's. Similarly, On is the number of rows, columns, or diagonals with just nO 's. The utility function assigns +1 to any position with X3=1 and -1 to any position with O3=1. All other terminal positions have utility 0 . For nonterminal positions, we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)(3O2(s)+O1(s)) 5. Circle the nodes at depth 2 that would not be evaluated if alpha-beta pruning were applied, assuming the nodes are generated in the optimal order for alpha-beta pruning