Model the following game as an adversarial search problem. Your modeling should be complete and detailed specifying state representation, actions, terminal test, state values, cuto evaluation, etc. There is a board that has six holes. There is a total of 20 small balls that are distributed in the holes randomly provided that no hole is empty. The game is played in turns by two players. In each player's turn, the player can remove any number of balls from ONE HOLE ONLY. The player that removes the last ball from the board loses the game

.

Please show me the tree of algorithm and everything in detail Note:I don't need any coding used in previous solution. I NEED ONLY PROBELM FORMUALTION AND SOLUTION EXPLAINED IN DETAILS I WILL GIVE A BIG LIKE IF YOU HELPED ME THE CORRECT WAY