Based on this data in the link below https://www.chegg.com/homework-help/questions-and-answers/game-tic-tac-toe-best-algorithm-solve-using-initial-states-goal-static-operators-sate-spac- q107049378 How can it be solved in a practical way What are all cases? And what is the best result What is the best way to solve it How can the path cost of this algorithm be calculated? Please do not use the code