Finite-State Machine problem

Please explain in detail . thanks

Alice and Bob are often playing a special game that is similar to the classic Tic-Tac-Toe game. To play this game, they take turns marking the spaces in a ix7 grid in any unmarked space. Alice marks X' and Bob marks O. Alice always goes first. Different from traditional tic- tac-toe game, in this game, one player wins once the other guy places three adjacent marks. For example, in the grid shown below, as Alice places three adjacent 'X' marks, Bob wins in this case according to ourl definition. If nobody wins and 7 marks are already placed, the game comes to a draw. (a) If we use a Finite State Machine to specify the behaviour of this game, how many possible states are needed to describe different situations regarding 1 space, 2 spaces and 3 spaces are marked respectively? You are not required to draw the diagram. You just need to write down 3 numbers for these 3 cases. (3 points) Alice and Bob are often playing a special game that is similar to the classic Tic-Tac-Toe game. To play this game, they take turns marking the spaces in a ix7 grid in any unmarked space. Alice marks X' and Bob marks O. Alice always goes first. Different from traditional tic- tac-toe game, in this game, one player wins once the other guy places three adjacent marks. For example, in the grid shown below, as Alice places three adjacent 'X' marks, Bob wins in this case according to ourl definition. If nobody wins and 7 marks are already placed, the game comes to a draw. (a) If we use a Finite State Machine to specify the behaviour of this game, how many possible states are needed to describe different situations regarding 1 space, 2 spaces and 3 spaces are marked respectively? You are not required to draw the diagram. You just need to write down 3 numbers for these 3 cases. (3 points)