6. Consider the min-max tree given in Fig. 1, where pointy-up triangles represent max nodes and pointy-down triangles represent min nodes (the root is a min node). Values of the evaluation function are given under each terminal (leaf).

6. (a) (9 points) Run a-B pruning on the above tree, assuming a standard left-to-right DFS order. List out the nodes that are pruned and why. As you do, show each step. You can do this by

listing out the initial a and B values for each node, and then providing new values next to/underneath those previous values. E.g., next to n, list the initial a value, then the next, then the next, and so on.

Striking out an edge if that node is pruned.