Subject: Artificial Intelligence.

Question No. 3 [10] Consider the following utility function for the game of tic-tac-toe: f(n) = (number of open rows, columns and diagonals for MAX) minus (number of open rows columns and diagonals for MIN) if n is an intermediate node f(n) = 9 if MAX wins at node n f(n) = -9 if MIN wins at noden Construct a game tree starting from the given state up to 2 ply depth. Assume that MAX plays X and it is MAX's turn to make the next move, assign values to all nodes of the game tree. 0 0 1 0