1. In a tic-tac-toe game, MAX (playing 'O) is about to make his next move from the initial state in the game tree given below. The numbers in circles are node IDs (a) Give the utility functions (1 for win, 0 for draw, -1 for loss) for all the leaf nodes (terminal states) (b) Give the minimax values for all the nodes. Which move(s) should MAX choose? (c) Determine the nodes that will NOT be checked if ?-? pruning is used. (Search is left to right) 0 11 19 21 23 24 28 32 34 20 25 26 31 35 38 39 40 42 1. In a tic-tac-toe game, MAX (playing 'O) is about to make his next move from the initial state in the game tree given below. The numbers in circles are node IDs (a) Give the utility functions (1 for win, 0 for draw, -1 for loss) for all the leaf nodes (terminal states) (b) Give the minimax values for all the nodes. Which move(s) should MAX choose? (c) Determine the nodes that will NOT be checked if ?-? pruning is used. (Search is left to right) 0 11 19 21 23 24 28 32 34 20 25 26 31 35 38 39 40 42