I need this program done in C

Please do the entire code

And please edit the code that i gave

No other form will work

Also provide screenshot please

In this problem we will write a program to simulate a circular walker. A walker walks along the index of an array in a circular manner. The size of the array is n. The indices of the array elements are therefore between 0 and n -1. When the walker is at the index k, he will go to index k+ alk] for the next step, if k + alk] is between 0 and n -1. Otherwise, the modular operation is used to ensure the result is between 0 and n-1. Before the walk leaves the current index k, the value alk] is decremented by i. For example, when k 2, and n 5, if alk] 4, then kalk] 2+4-6. Applying modular operation we have 6%n = 6%5 = 1. Hence the next index is 1. Before the walker goes to index 1, al2) is decremented by 1. and heuce a[2] becomes 3. Note if alk] is 0, the walker will stop. In the starter code rotate.c, implement the function int next.index (int a], int k, int n) This function returns the index for the next step and also updates alk] before the function returns Do not change the main() function. Only write code inside the next-index() function. If vour code is correct, you will notice the walker stops at a special location. #include #include #include #de fine MAX leeeee //Return the next index and update a[] int next index (int af], int k, int n) int main(int argc, char argvI]) 5 if (argc! -2) n ", argy[B]); printf("Usage: return -1; %s 19 int a [MAX]; 21 23 24 int n = atoi (argv[1]); assert (n1 && nMAx); for (int i-0; i ) a[k] ) ; printf("k=%d a[Nd] = %d ", k next index (a, k, n); k, k, 34 k, k, a[k]); printf("finally:inkad a[Nd] return e; -%d ", 36 37 38<>