java

5. Apply the merge sort on the table below to show the time complexity of the algorithm. No of Elements 100 Data Source (Random) String ("A", "3", "C"."Z") Elapsed Time (ms) 1,000 String ("A","9","C"..."2") 10,000 Data Type String random length (max length 20) String random length (max length 20) String random length (max length 20) String random length (max length 20) int int int int String ("A","8","C".."2") 80,000 100,000 200,000 500,000 1,000,000 100,000 double String ("A", "B","C"..."2") int type (10000-100000) int type (10000-100000) int type (10000-100000) int type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) 200,000 double 500,000 double 1,000,000 double Note: Compare the results with Selection and Insertion Sort. Use your previous Excel sheet to Ing in the results 5. Apply the merge sort on the table below to show the time complexity of the algorithm. No of Elements 100 Data Source (Random) String ("A", "3", "C"."Z") Elapsed Time (ms) 1,000 String ("A","9","C"..."2") 10,000 Data Type String random length (max length 20) String random length (max length 20) String random length (max length 20) String random length (max length 20) int int int int String ("A","8","C".."2") 80,000 100,000 200,000 500,000 1,000,000 100,000 double String ("A", "B","C"..."2") int type (10000-100000) int type (10000-100000) int type (10000-100000) int type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) double type (10000-100000) 200,000 double 500,000 double 1,000,000 double Note: Compare the results with Selection and Insertion Sort. Use your previous Excel sheet to Ing in the results