b$)[25$ pts$.]$ Given the game board board$2$ above where it is X$$s turn to play next, show the game tree with a cut$-$off depth of two levels $($i$.$e$.,$ stop after each player makes one move$).$ Use the following evaluation function on all leaf nodes: $$Eval$($s$)=10$X$3($s$)+3$X$2($s$)+$ X$1($s$)(10$O$3($s$)+3$O$2($s$)+$ O$1($s$))$where we define Xn$($s$)$ as the number of rows, columns, and diagonals in state s with exactly n X$$s and no O$$s$,$ and similarly define On$($s$)$ as the number of rows, columns, and diagonals in state s with exactly n O$$s and no X$$s$.$ Use the minimax algorithm to determine X$$s best move. Use the same ordering of moves as in part $($a$).$