In java code, write MERGE SORT algorithm that uses LOCALITY AWARENESS. For example if int[] a = {3, 0, 4, 1, 5, 2, 9, 7, 8, 6} and int d = 3, then after mergeSort a should equal {0,1 ,2 3, 4, 5, 6, 7, 8, 9}. The runtime for the implementation should be no worse than O(N*log(d)). We know that no element will move more than d positions. Function header and parameters are as follows:

.

.

public static void mergeSort(int[] a, int d) {

// TO BE IMPLEMENTED

}