Write a program in python that has an array of keys $($e$.$g$.$ integers$)$ and five procedures:

A procedure that implements selection sort.

A procedure that implements insertion sort.

A procedure that implements heap sort.

A procedure that implements mergesort $($using possibly an auxiliary array$).$

A procedure that implements quicksort.

Run these five procedures on the same array, filled with randomly generated values, for the following sizes:

$10,100,1000,10000,100000,1000000,10000000.$