please its due in 5 min,

Question 3: Let A be an unsorted array. Say that all the elements are pairwise disticts, and Ai] is in placeaA[ji] in the sorted array. We define the distance from the correct place of A[i] as \I jil. Say that all the distances of every A[i] is at most 20. Give an approximation algorithm for sorting under this assumption. Example: Let A =. Say that the first entry or the array is A[1]. The srted array is . The distance of 7 is 6 1 = 5. The distance of 4 is 4 2 2. The distance of 3 is 0. The distance of 4 is 4 2 = 2. The distance of 6 is 0. The distance of 1 is 6 1= 5. - 7 -> =