public class MyMergeAlgo { public int[] merge_sort(int[] array){ if(array.length<=1){ return array; } int midPoint=array.length/2; int[] left = new int[midPoint]; int[] right = new int[array.length-midPoint]; int result[]=new int[array.length]; for(int i=0;i

how to modify this code so it can work as descending order