5.25 Consider the Nim game: There are n number of tokens. Each player is required to divide the pile of tokens into two piles of unequal tokens. The player who cannot divide any pile further looses the game. Solve it with n = 5 using minimax algorithm. Assume MAX takes first move. Also show the path for MAX's win. =