QUESTION: Design a decrease-and-conquer algorithm that finds the winner of the game and implement in PYTHON. Make sure your algorithm runs in logarithmic time.

Consider a game with n players {P1,P2,,Pn}. The players are lined up circularly and at each step, a player eliminates the nearest player on their left. The game starts with P1 's move. P1 eliminates P2. Then the next player in the line, P3, makes a move and eliminates P4. In the end, only one player is left and that player wins the game. Examine the following examples to understand the game better. Enmmnlas n - 6 1 Example: n=7