Two players play the following rock game with two piles of rocks of heights n and m. pile or the second pile) and one other. The player who cannot complete their turn loses. 1. Who will win? Using dynamic programming, describe a general winning strategy for each n and m. (10 points) 2. Show the details of the winning strategy for n-m-6.(5 points)