1)Implement the algorithm MergeSort a in Java

2) Implement the algorithm MergeSort a in Java

Algorithm MergeSort(L,lo,hi)

if(lo>=hi) return L;

mid?(lo+hi)/2;

L?MergeSort(L,lo,mid);

L?MergeSort(L,mid+1,hi);

return Merge(L,lo,mid,hi);

Algorithm Mergesort (L,n) if(n=1) return L; for j?1 to n/2 do L1+L [ j ] ; for j?n/2+1 to n do L2- -L [j]; LI?Mergesort (L1 , n/2 ) ; L2?Mergesort ( L2, n-n/2) ; return MergeTwoLists (L1,L2); Algorithm MergeTwoLists(L1,L2,m,n) for k? 0 to m+n-1 do else return Li