1. Write a program that obtains the execution time of selection 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. You can assume the range of the numbers are [0, 100000). Your program should create data randomly and print a table like this: Array Selection Merge Size Sort Sort 10000 38 20000 142 30000 121 40000 217 50000 330 60000 479 3 4 6 9 11 18 Quick Sort 222356 Heap Radix Sort Sort 24 10 7 13 7 3 9 5 13 7 14 6