You are playing the dots and boxes game on a 3x3 grid shown below. Each player has to draw an edge connecting two dots, if it doesn't already exist. The player who draws the 4th line making a unit square receives a +1 score. The player with the largest score after none of the players can draw edges anymore wins the game. HI It's the max player's turn. a) Apply the Minimax algorithm to the above state, by preferring horizontal moves to vertical moves, and expanding in increasing order first by row, then by column. For convenience, you can represent the moves as (start row, start column, end row, end column), e.g. drawing a vertical line in the bottom right corner can be represented as the move (3, 3, 2, 3) or equivalently (2, 3, 3, 3). Draw the corresponding search tree. b) Apply the alpha-beta pruning method using the same order of node expansion and show the alpha-beta values for all nodes. Is there any advantage to using alpha-beta pruning?