Write a Java program modifying the standard Merge Sort algorithm to perform the merging of the two subarrays in-place, without using any additional memory for creating temporary arrays. The goal is to reduce the overall space complexity of the algorithm.

public class MergeSort {

  public static void main(String[] args) {
    int[] data = {5, 2, 4, 7, 1, 3, 2, 6};
    System.out.println("Before: " + Arrays.toString(data));
    mergeSort(data);
    System.out.println("After:  " + Arrays.toString(data));
  }
  public static void mergeSort(int[] data) {
    if (data.length > 1) {
      int mid = data.length / 2;
      int[] leftData = Arrays.copyOfRange(data, 0, mid);
      int[] rightData = Arrays.copyOfRange(data, mid, data.length);
      mergeSort(leftData);
      mergeSort(rightData);
      merge(data, leftData, rightData);
    }
  }
  public static void merge(int[] data, int[] leftData, int[] rightData) {
    int i = 0;
    int li = 0;
    int ri = 0;
    while