Using Java Eclipse

1.1 Overview The main purpose of this programming assignment is for students to have a deep understanding of how to implement Mergesort algorithm and evaluate its performance. 1.2 Details restriction on the programming tools/IDEs/environments to be used. Implement the following: 1) Implement Mergesort algorithm; run the program on nine different arrays of real numbers, Array 1, Array 2, .. and Array 9; fill out the following table in an Excel spreadsheet (named Mergesort_Time.xls(x)). Input size n for Value of n logn Time spent (seconds or Value of (n logn)/time (using scientific notation: x 10', with x milliseconds or nanoseconds) Array i being a rounded integer) . The size of Amy, should be no less than 1000 . i, but the actual array sizes are of your Elements in each array are also of your choice, and you are highly suggested to use the program to generate random real numbers. The Excel spreadsheet can be automatically (i.e., by your program) or manually filled out. 2) Design an interface that allows the user to choose an arbitrary number i (the value of i is from to 9). The interface will then display the original Array_i followed by the sorted Array i. 3) The interface will keep waiting for the user selection until the user chooses to exit. 2. Required Deliverables Source code with adequate comments, with the file name PA-2-Source.xxx