Please help!!

General Questions 1. Consider the state of a tic tac toe board in the image above, assuming X begins first count how many possible ways are there to begin a game and reach this state. (10 pts) 2. Consider a program which plays tic tac toe and uses one of the search algorithms you have seen in class to search for terminal states (.e., win, draw, loss). The root node (no marks on board) is at a depth level of 0. (10 pts) a. What is the maximum depth level of a terminal state? b. What is the minimum depth level of a terminal state? c. What is the minimum depth level of a terminal loss? d. What is the minimum depth level of a terminal win? 3. Suppose you are implementing a tic tac toe Al with a heuristically-guided technique. The board is represented by an array of 9 cells where -1 represents X, 1 represents O, and o represents a free space, design a heuristic function H(B, P) that takes as parameters the board B, and the Player P(-1 or 1), and returns how well that player is doing. Explain briefly the intuition for your function and discuss its rationale. (10 pts)