Q6: Given an array A, give pseudocode and big-Oh running time analysis for an algorithm that determines which permutation of the stable sorted order is A. Meaning, output an array P, such that P[i] is the index of the element A[i] after a stable sort of A.For example, given A= [4 3 10 8 4], the output should be P= [1 0 4 3 2]. So A[0] = 4 and it is at index 1 in the sorted order. Thus, P[0] = 1, etc. Note that because of the stable sorting, the last 4 goes to index 2 (and thus P[4] = 2). Furthermore, A[1] = 3, which ends up at index 0 in the sorted order. Thus, P[1] = 0. So on and so forth. You may assume access to a stable sorting algorithm. If the whole discussion about stability is confusing you, solve this problem assuming all elements are distinct. (In this case, the stability is irrelevant.) You will get partial credit. Answer: