python code please, i want to study it

1. Write a function random_list(range_max, size) that returns a list of size random numbers in range(1, range_max).

[2] Write or call a function that will confirm that the list has been sorted. If it detects an error, make sure to print it very conspicuously (or throw an exception) so that the error can be researched.

[3] In your main function, iterate over QuickSort for the same list size. Capture the time before and after so you can track the elapsed time for the sorting algorithm. [Repeat these runs multiple times for the same size and find their average time.]

[4] Summarize the results in a table. Place the sorting algorithms along the left side and the different sizes across the top.