Part III Name That Sort (12 pts) Below you will find some intermediate steps in performing various sorting algorithms on the same input list. The steps do not necessarily represent consecutive steps in the algorithm, but they are in the correct sequence. Identify the algorithm for each problem: Input list: 1. 1429,3291,7683,1337,192,594,4242,9001,4392,129,10001.1429,3291,7683,192,1337, 594,4242,9001,4392,129,10001429,3291,192,1337,7683,594,4242,9001,129,1000, 4392192,1337,1429,3291,7683,129,594,1000,4242,4392,9001 2. 1337,192,594,129,1000,1429,3291,7683,4242,9001,4392192,594,129,1000,1337,1429, 3291,7683,4242,9001,4392129,192,594,1000,1337,1429,3291,4242,9001,4392,7683 3. 14293.1337,1429,3291,7683,192,594,4242,9001,4392,129,1000192,1337,1429,3291, 7683,594,4242,9001,4392,129,1000192,594,1337,1429,3291,7683,4242,9001,4392, 129,1000 Submit a Python file for each of the following questions and the output should be pasted for the program. (Do not use prebuilt Python functions/methods such as sort, count, min or max functions.) These should be solved using loops and comparisons. Example: 1. Find the smallest and largest numbers in the following unsorted list using the provided binary search algorithm. [4,2,7,3,8,5] 2. Find the smallest missing element in the range (2,9) of the sorted list: [2,3,4,5,7,8,9]. Assume the elements in the list being increased by 1 . 3. Count the number of occurrences of the number 7 in the following sorted list: 1,2,2,2,5,7,7,7,8,9