Program: Prepare a C program that has this description.
//Use: Rearrange(x, p, n);
//Pre: n is an integer, >= 0. x points to the first element of an int array with n position. p points to the first element of another int array array, also with n position.
//Post: The array x points to has not changed. The array p points to contains permutation of the numbers 0...n-1 so x[p[0]] <= x[p[1]] <= ... <= x[p[n-2]] <= x[p[n-1]].
For example: If x contains the numbers 1 9 2 8 3 7 4 6 5, then should p get the numbers 0 2 4 6 8 7 5 3 1
I'm not sure how to solve the question. Can anyone help me?