Write a program that will use the four sorts (Selection sort, Heap Sort, Quicksort and Merge Sort). Each of the four sorts should
be TIMED on three different lists of integers. For each sort use
a) an inorder list
b) a reverse order list
c) a list in random order.
This will be a total of 12 timings