Translate the following pseudo code into Java

Note that merge takes two already sorted files. Therefore, we need another procedure, merge Sort, to actually sort these files. merge Sort is a recursive procedure, which at each step takes a file to be sorted and produces two sorted halves of this file. Because merge Sort continuously calls merge, and merge works on two identical arrays, we must create a copy of original array, source, which we will call destination. Algorithm merge Sort (source, destination, lower, upper) Input: source array; a copy of source, destination; lower and upper are integers defining the current sublist to be sorted. Output: destination array sorted. if (lower upper) { mid := (lower + upper)/2 merge Sort (destination, source, lower, mid) merge Sort (destination, source, mid+1, upper) merge (source, destination, lower, mid, upper) } Algorithm Sort (A, N) Input: Array, A, of items to be sorted; integer N defining the number of items to be sorted. Output: Array, A, sorted. create & initialize destionation[N] merge Sort (A, destination, 1, N)