Finite State Machine Given the rules of Tic Tac Toe:

a$.$ This is played on a $3$x$3$ square board

b$.$ Players take turns placing characters into empty squares

c$.$ The first player always places $$X$$ characters, while the second player always places $$O$$ characters.

d$.$X$$ and $$O$$ characters are always placed into empty squares, never filled ones.

e$.$The game ends when there are three of the same $($non$-$empty$)$ character filling any row, column, or

diagonal.

f$.$ The game also ends if all squares are non$-$empty.

g$.$ No more moves can be played if the game is over.

Tasks:

a Draw the transition diagram of a Tic$-$Tac$-$Toe game

b Provide the transitions as a table

Don't provide any Ai answer

Sample transition diagram:

Sample transition table: