Write a program which, given an unsorted array of numbers, will print out the information that would allow us to sort the array (least-to-greatest) in one pass. This is the permutation that the original array is in, relative to its sorted order. For example, if you were given the array A = [100, 50, 60, 250], then the permutation is P = [1, 2, 0, 3]. Then if we were to walk across this permutation, we could create the sorted array S by doing the following:

S[0] = A[P[0]]

S[1] = A[P[1]]

S[2] = A[P[2]]

S[3] = A[P[3]] You may use a sorting algorithm to solve this problem. This is a hint