Please do the program in PYTHON. Please don't forget to take a look at the PROGRAM CRITERIA to get more idea and for completeness.

Description In this lab, we will be experimenting with sorting algorithms and comparing their runtimes. You will implement the algorithms to compare. You may reference an algorithm provided online in the form of either pseudocode or actual code, but if you do it MUST be cited. Specify the name of the algorithm and the URL where you cited. For Algorithm 1, choose one from the following algorithms: 1. Bubble Sort 2. Selection Sort 3. Insertion Sort For Algorithm 2, implement Merge Sort For Algorithm 3, implement Quick Sort For each of the algorithms, you will create 15 lists to sort. This will result in 45 total lists to sort. The following describes what each list will consist of for each algorithm: n 10000 ist1all sorted list2all reversed .list 3, list 4, and list 5 all randomized n 50000 ist1all sorted list2all reversed .list 3, list 4, and list 5 all randomized n 100000 ist1all sorted list2all reversed .list 3, list 4, and list 5all randomized