# ##### 83 84 85 The first six moves of a tic-tac-toe (noughts and crosses) game is shown above (left to right). It is now X's turn, starting at the right-most state. 86 (a) Draw the game tree starting from the final position shown above. The game tree should include all terminal states as well. Apply minimax search to this tree, showing the backed-up value of each node. (b) Does X have a winning strategy at the current (right-most) state? What should X play next? (c) Recall that a game is "solved" if the outcome of every game state is known, assuming each player plays optimally (in a minimax fashion) from that state onward. Tic-tac-toe is a solved game; the optimal outcome from the all-blank state is a draw. In the above game, did any player play suboptimally? If so, which move(s) do you think was suboptimal?