Need help with thin in c programming language

Part 2: Josephus Puzzle (50 points) This question is from Algorithms, 4th Edition by Sedgewick and Wayne. every Mth person until only one person is left. Legend has it that Josephus figured out where to sit to avoid being eliminated. Learn more about the problem here: The Josephus Problem - Numberphile Implement the function josephus (n,m) in queue.c. the last index of the array. You must use your Queue from the previous part to solve this problem. Simplification Assumptions: 1. You may assume the user will always give two positive numbers. 2. Your array will always have n elements. 3. The main program already prints the array for you. Here are some example executions. Test 01 %./ main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: Enter Number of People (N): Enter Person to Eliminate (M): 2 Order Eliminated: 1350426 Test 02 \%./main Select Option from list. 0.) Run All Tests 1.) Test New Queue 2.) Test Enqueue 3.) Test Front 4.) Test isEmpty 5.) Test Dequeue 6.) Run Randomized Tests 7.) Josephus Puzzle Enter Number of test to run: 7 Enter Number of People (N): Enter Person to Eliminate (M): 3 5 1