Answer in Java

Implement both a linked list-based version of Mergesort and an array-based version of Mergesort. 1. Generate a list of 1000 or more elements to be sorted. a. Generating a list in reverse order produces the worst case. 2. Compare the running times of the two versions. a. Save the time in ms before the start of the sort, and, save the time at the end of the sort. Be sure not to include the time for generating the list and the time to display the sorted list. Take the difference between to the times to determine the running time