In the game of Coins, two players are given a stack of N coins and are to take coins until the stack is empty. At each turn, a player must take up to three coins. The player that empties the stack loses. 1. Draw the full game tree for N=4. 2. Assume the utility of a state S is F(S)=1 if Max wins, and F(S)=0 otherwise. Give the values assigned by the Minimax algorithm to all nodes of the tree. 3. Circle all nodes that would not be evaluated by the Alpha-Beta algorithm during a left-to-right depth-first exploration of your tree. Use the editor to format your