0 11 12 19 21 24 28 32 34 20 25 26 35 38 39 42 2. For the tic-tac-toe game, design an evaluation function for MAX (playing 'O). Test the evaluation function on only a 2-ply version of the tree above. This means that the tree only includes nodes 1-16 and the evaluation function is only computed for nodes 5-16 reasonable should MAX choose? (a) Clear explain how your evaluation function is defined. The answer is not unique, but it should be (b) Apply Minimax to the 2-ply tree, and give the minimax values for all the nodes. Which move(s) 0 11 12 19 21 24 28 32 34 20 25 26 35 38 39 42 2. For the tic-tac-toe game, design an evaluation function for MAX (playing 'O). Test the evaluation function on only a 2-ply version of the tree above. This means that the tree only includes nodes 1-16 and the evaluation function is only computed for nodes 5-16 reasonable should MAX choose? (a) Clear explain how your evaluation function is defined. The answer is not unique, but it should be (b) Apply Minimax to the 2-ply tree, and give the minimax values for all the nodes. Which move(s)