arr insert( )arr insert( )arr insert( )arr insert( )arr insert( )arr display()/display items arr mergesort()/mergesort the array arr display()/end main(/display items again /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 -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 - entering - base-case return - will sort high half of - entering - base-case return - will merge halves into - return - will sort high half of - entering - will sort low half of - entering - base-case return - will sort high half of - entering - base-case return - will merge halves into - return - will merge halves into - return - thearray= thearray= thearray= this is roughly the same content as would be generated by the mergesort workshop applet if it could sort items study of this outputand comparison with the code for