(Execution time for sorting) Write a program that obtains the execution time of selection sort, bubble sort, merge sort, quick sort, heap sort, and radix sort for input size 50,000, 100,000, 150,000, 200,000, 250,000, and 300,000. The sample run should look like this table and should create data randomly:

SAMPLE RUN:

Hint: Use the code template below to obtain the execution time

Correct Answers Will Be Rated! :)

Array Selection Insertion Bubble Merge Quickt Heap Radix size Sort Sort Sort Sort Sort Sort Sort 10000 38 33 107 10 20000 142 121 463 13 30000 121 91 1073 40000 217 161 1924 50000 330 255 3038 11 60000 479 374 4403 18 14 x 033576 L r 11 do as pt477934 ar2 eo HS k rt 22 tt222356 CO is et346918 gr 11 ro eS et733483 r06723 b 014090 bS 113 nt31-154 0 r329657 "Z O 123 tS nt82-709 0 r342-37 "Z O 11234 tS ye000000 z000000 r*z 0 0 0 0 0 0 rs000000 123456