For the following problem, you do not need to use induction to justify your answer (in any of the parts). It is enough to sufficiently develop the pattern of the Sprague-Grundy function so that you can write down the function. (a) Consider the take-away game in which you are only allowed to take an odd number of chips from each pile. Write down the Sprague-Grundy function for this game. If we now play this with two piles of sizes (8,15), is this an N-position or a P-position? If it is an N-position, what would be a winning first move