Python

1. Consider a game of NIM played on 4 piles wth 50, 51, 52, and 53 stones, respectively. Two players take turns removing as many stones as they want. They can only remove from one pile in their turn, and they must remove at least one stone. Describe the process needed to determine who wins the game. Who wins this game and what is a winning move? 2. Consider the same setting from the previous question, but this time we can remove 1 or 2 stones from the first pile. 2 or 3 stones from the second pile. 1 or 3 stones from the third pile, and 2 or 3 stones from the last pile. Describe the process needed to determine who wins the game. Who wins the game, and what is a winning move