Implement 5 functions in Python that would sort an unsorted list, i.e • def bubble_sort(my_list): • def selection_sort(my_list): • def insertion_sort(my_list): • def quick_sort(mylist): • def insertion_sort(mylist, left, right): Provide a main that uses each of the above functions to sort a list of length 100 and make sure it works as expected Step 2 Add lines of code to the above functions so that apart from sorting the received list, it calculates T(n) and returns it. This means that each of the above functions will have a return value which is the exact number of operations executed to perform the sort. Use a main to test yout T(n) calculation. A good way of testing your T(n) is this. Send a best case scenario, a worst case scenario and an average scenario to your sort function and see what numbers come out for your T(n). Explain what best, worst and average case scenarios will be for a sorting algorithm. Step 3 Use the sort functions with T(n) calculation feature to plot T(n) vs. n for a wide range of list sizes. Say 10, 50, 100, 500, 1000, 5000, 10000, 50000, 100000, 1000000, 10000000. Make sure you use a WORST CASE scenario for your list so that your T(n) is a good reflection of O(n). Do you see your curves aligned with what we learnt about the performance of the sort algorithms Step 4 Using time library in python, time your sort algorithms for the same list sizes that you plotted in step 3 and this time plot algrithm completion time vs n. Interpret the results while compared to the step 3 plot and compared to your knowledge of the algorithm's performances. Don't forget to use WORST CASE scenario. Example for Step 2 in bubble sort: def bubble_sort (my_list): steps = 0 for i in range (0, len (my_list) - 1): for j in range (0, len (my_list) - 1 - i): if my list[j] > my_list[j + 1]: steps += 4 # 4 operations, 3 for the swap and one for the comparison my_list[j], my_list[j + 1] = my_list[j + 1], my_list[j] return steps Code to create a random list of a specific size for steps 3 and 4: import random listSize = 50 rand_list = [random.randint (0,101) for val in range (listSize)] rand_list.sort (reverse=True) print("steps needed for sorting: {}".format (bubble sort (rand list)))

Write a function called remove_odd that takes a list of numbers that have both even and odd numbers mixed.# Function should remove all the odd numbers and return a compact list which only contains the even numbers. Example1: Function Call:remove_odd ([21, 33, 44, 66, 11, 1, 88, 45, 10, 9])Output:[44, 66, 88, 10]

How do I make a program that keeps track of a phone speed dialer directory which has 5 fixed slots, without changing the starter code. # Program to simulate a speed dialer# Complete the functions listed below that work with# two lists that manage a dialer with 5 fixed slots.def printList(names,numbers):'''function to show the current dialer data as shown in sample runs'''#Implement this functionpassdef updateSlot(names,numbers):'''Function to handle update by slot number command whichprompts the user for the slot number to be updatedUses try-except to handle error cases:if slot number not within valid rangeif user enters non-integer inputIf slot number is valid, thenprompts the user for the new name and new numberand updates entries for the slot number.prints "Updated slot number X" where X is the slot number user entered.'''#Implement this functionpassdef dialByName(names,numbers):'''Function to handle dial by name command whichprompts the user for the namechecks if the name is…

Write a python program that takes two lists, merges thetwo lists, sorts the resulting list, and then finds the median of theelements in the two lists. You cannot use python build-in sort() function #todo#You can use math functions like math.floor to help the calculationimport math #todo#You can use math functions like math.floor to help the calculation import math def task7(list_in_1, list_in_2):  # YOUR CODE HERE                return median please use these variables no print function please