Having the following goal states for the XO game: XXX X X X XXX X X X X X X X X X X X x X and having the following current state s= OXX OX O Assume it is x-turn to play 1- Generate the game tree until reaching the leaf nodes 2- Using mini-max algorithm set the value for each node 3- Decide the winner for the game if any Having the following goal states for the XO game: XXX X X X XXX X X X X X X X X X X X x X and having the following current state s= OXX OX O Assume it is x-turn to play 1- Generate the game tree until reaching the leaf nodes 2- Using mini-max algorithm set the value for each node 3- Decide the winner for the game if any