Consider the following search space for the two$-$player game called Tic$-$tac$-$toe, where

each player occupies a cell in turns, with the objective of placing three marks in a

horizontal, vertical, or diagonal pattern. One player uses cross $\text{'}$X$\text{'}$ as his marker, while the

other uses a naught $\text{'}O\text{'}.$ Assume that the current state of the game where it is the turn of

player $\text{'}$X$\text{'}$ to Play.

Apply adversarial search strategy to draw the game search tree starting from the above

state.