2. Let a be the following game of Cram: (a) Draw the game tree of a and label each node with its Grundy number. (b) Does the next player have a winning strategy? (c) By considering a as sum of games, verify Gr(a) computed in part (a). 2. Let a be the following game of Cram: (a) Draw the game tree of a and label each node with its Grundy number. (b) Does the next player have a winning strategy? (c) By considering a as sum of games, verify Gr(a) computed in part (a)