Assume you are using MCTS to decide the next move for the two$-$player game, with

possible actions being up or down. Your present state is A$,$ and you must decide

between making an up or down move. Based on the iterations, understand the tree as a

$2-$player game tree. Let q be the estimated value and n be the number of visits to that

state so far. Assume the moves are equi$-$probable if required. Explain how MCTS selects

the next state for expansion $[4\mathrm{.}0$ M$].$