listing recursion continued public static void main(string[argsint maxsize /array size darray arr/reference to array arr new darray(maxsize)/create the array arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )/insert items arr display()/display items arr mergesort()/merge sort the array arr display()/display items again /end main(/end class mergesortapp ///////////////////////////////////////////////////////////////the output from the program is simply the display of the unsorted and sorted arrays if we put additional statements in the recmergesort(methodwe could generate running commentary on what the program does during sort the following output shows how this might look for the four-item array { (you can think of this as the lower half of the array in figure entering - will sort low half of - entering - will sort low half of -