2. (10 pts) An array is almost k sorted if every element is no more than k positions away from where it would be if the array were actually sorted in ascending order As an example, here is an almost 2-sorted array: Original Array:1 ,2315 , Sorted Array: (a) Write down pseudocode for an algorithm that sorts the original array in place in time n k log k. Your algorithm can use a function sort(A, ,r) that sorts the sub- array A[q,..., Alr] Note: you will be working on this problem in recita