Part 1. Locality Aware Sorting In this part, we consider sorting input integer arrays that are locality aware. What we mean by that is that we know the range of possible indexes that a particular element may end up in after the array is sorted. The range is determined by the value d. What is meant by locality awareness. Let A be an array that is locality aware with d = 7. Let x = A[i] in the original array. Let f be the index of x in the final, sorted array. According to the property of locality awareness, i-d