(Solved): Rearrange the following lines of code to produce a version of the sort method in the MergeSorter c ...

Rearrange the following lines of code to produce a version of the sort method in the MergeSorter class that uses the merge method of the preceding exercise. Mouse: Drag/drop Keyboard: Grab/release Spacebar (or Enter ). Move \( \uparrow+\rightarrow \). Cancel Esc 3 while (iSecond \( <= \) to) \{ result \( [j]=a[ \) iSecond \( ] ; \) isecond++; j++; 3 return result; 3 public static void main(String[] args) \{ \( \operatorname{int}[] \mathrm{a}= \) new \( \operatorname{int}[]\{1,4,9,16,2,3,5,8\} \); \( \operatorname{sort}(a, 0,5) \); System.out.println(Arrays.toString(a)); 3 \}