Perform alpha-beta pruning on the tree from \#1. Assuming we use the variable v to represent the value currently assigned to the node, list the alpha (), beta () and value (v) variables of each node as (,v,), Generate the tree in the space below (you may want to do it on a separate piece of paper and then copy it over when you are sure you have it) using a depth-first search. When alpha-beta pruning determines that you can prune certain nodes, then draw an " X " instead of the corresponding node or sub-tree. Use the table to help you keep track of the current (,v,) state of each node. So, the (,v, ) state at the bottom of each row represents the current state of that node. Values in the same row have no meaning...the most important thing is that each value on the bottom of each column represents the current (,v,) values for that state upon completion of the search