Two players have in front of them a single pile of objects; say a stack of 7 tokens. the first player divides the original stack into two stacks that must be unequal. each player alternatively thereafter does the same to some single stack when it is his turn to play. the game proceeds until each stack has either just one token for two—at which point continuation becomes impossible. the player who first cannot play is the loser. draw the complete search tree. apply minimax procedure on the complete search tree. assuming min plays first. the utility function f is defined as: 0 = a win for min, 1 = a win for max.