can someone please solve both the parts

There is a game for n people sitting in a circle. We give each of them a label starting from O to n-1. They count numbers clockwise and the game starts from the first person with counting 1. The person who says the number k should leave the circle and the person next to him should start counting from 1 again. The only person remaining in the circle wins the game. program should accept two inputs n and k and output the lable of the person who won Your the game a naive algorithm to solve this problem. Please use stepwise refinement to describe your design (in C/C++ or pseudocode). You can do it for two iterations. First provide a high level design of the implementation and then refine the design in more detail. Also please state the time complexity of your algorithm. Now the time complexity of your algorithm is restricted to O(n). Describe your idea first and then implement it in C/C++ or pseudocode. (Hint: use Dynamic Programming to (2) solve this question.)