Consider a game where two players take turn picking 1, 2,3 or 4 sticks (depending on the remaining number of sticks left in the box) from a box initially having 6 sticks. The player who picks the last stick(s) loses the game. Player 1 is the first player to make a move. 1. Draw the complete game tree. 2. Assign which player is the Min and Max player. Use backtracking to assign evaluation values to all nodes starting from the leaves up to the root. 3. Based on the evaluation value of the root, who will probably win the game if both players play their best? 4. Apply alpha-beta pruning to the complete game tree. Are there nodes pruned? If yes, indicate the pruned nodes in the game tree drawing. Given: The root of the game tree with 6 sticks (initial game state) I. Determine the final payoff/evaluation value of the root using backtracking with alpha-beta pruning. Indicate the pruned node(s) if there is/are any. Consider a game where two players take turn picking 1, 2,3 or 4 sticks (depending on the remaining number of sticks left in the box) from a box initially having 6 sticks. The player who picks the last stick(s) loses the game. Player 1 is the first player to make a move. 1. Draw the complete game tree. 2. Assign which player is the Min and Max player. Use backtracking to assign evaluation values to all nodes starting from the leaves up to the root. 3. Based on the evaluation value of the root, who will probably win the game if both players play their best? 4. Apply alpha-beta pruning to the complete game tree. Are there nodes pruned? If yes, indicate the pruned nodes in the game tree drawing. Given: The root of the game tree with 6 sticks (initial game state) I. Determine the final payoff/evaluation value of the root using backtracking with alpha-beta pruning. Indicate the pruned node(s) if there is/are any