Suppose we are given an unsorted array. Let s$($i$)$ be the index of A$[$i$]$ in the

sorted array, with the index starting at $1.$ Define distance$($i$)=|$s$($i$)$ i$|.$ Provide an

algorithm that sorts the elements, assuming that distance$($i$)<=20$ for every i