Problem 3: Consider a variation of Game of Nim. The game begins with a single pile of stones. The move by a player consists of dividing the pile into two piles that contain unequal number of stones. For example, if one pile contains six stones, it could be subdivided into piles of 5 and 1, or 4 and 2, but not 3 and 3 The first player who cannot make a move loses the game. A. Draw the complete game tree for this version of Nim if the start state consists of 6 stones B. Perform a minimax evaluation for this game. Let 1 denote a win and -1 a loss [40 Points, 20 points each]