14. Suppose you are given 4 data sets with the below structure: Set 1: Sorted in reverse order Set 2: Random Set 3: Elements in every other position are in the proper spot Set 4: Contains only 4 unique elements (rest duplicates) Which sorting algorithm will take the same amount of time to run on all 4 data sets (think of what each algorithm does in terms of steps) a. QuickSort b. RadixSort c. BubbleSort d. MergeSort

Use a physical stopwatch to record the length of time it takes to run the program. calculate the difference obtained by calls to the method system.currenttimemillis() just before the start of the algorithm and just after the end of the algorithm. calculate the difference obtained by calls to the method system.currenttimemillis() at the start of the program and at the end of the program so that the elapsed time includes the display of the result. use the value returned by the method system.currenttimemillis() just after the end of the algorithm as the elapsed time.