Java Merge Sort

Question

public static void sort(int[] a, int[] aux, int lo, int hi) {
if (hi <= lo) return;
int mid = (lo + hi) / 2;
sort(a,aux, lo, mid);
sort(a, aux, mid + 1, hi);
merge(a, aux, lo, mid, hi);
}
What will happen , when hi >lo?

Answer 1

If(hi <= Lo) Return;

If hi > Lo it makes the Rest of the Code