#### Part 1 Write a Python function (`insertion_sort`) that implements the insertion sort algorithm, discussed in the lectures. This function will take exactly one list argument, and will return a list. The argument (`values`) is a list of integers to be sorted. You will return a new list which has been sorted in ascending order. Below, you will find some code to test your insertion sort: ```python unsorted = [4,3,7,1,8,2] sorted = insertion_sort(unsorted) print(sorted) ``` #### Part 2 Modify your `insertion_sort` function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the sorted list (in that order). _**Note:** For simplicity, since counting these comparisons won't improve the accuracy of your count very much, we'll ignore the comparisons made in the final iteration of the loop. One or both of these comparisons may actually be made, so determining the exact number of comparisons would be more challenging. Thus, you can just count the comparisons made within the body of the loop._ The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences): ```python max_elements = 30 for length in range(1, max_elements): unsorted = list(range(length, 0, -1)) sorted, num_comparisons = insertion_sort(unsorted) print(f'{num_comparisons:03d}', '*' * (num_comparisons // 10)) ``` The output of the test code has been provided, below: ``` 000 002 006 012 * 020 ** 030 *** 042 **** 056 ***** 072 ******* 090 ********* 110 *********** 132 ************* 156 *************** 182 ****************** 210 ********************* 240 ************************ 272 *************************** 306 ****************************** 342 ********************************** 380 ************************************** 420 ****************************************** 462 ********************************************** 506 ************************************************** 552 ******************************************************* 600 ************************************************************ 650 ***************************************************************** 702 ********************************************************************** 756 *************************************************************************** 812 ********************************************************************************* ```

Write a python code 3) Write a script that asks user to enter 10 integer numbers, creates a list from those numbers, then calls verifsort function to detect if this list is sorted, prints message (list is sorted or list is not sorted) and if it’s not sorted then calls listsort function and prints the sorted list after listsort returns.

def second_largest(lst: List[int]) -> int:    """    Given a list <lst> of integers, return the second largest item in the list    without modifying <lst>. You cannot use any of python's builtin sorting    functions. Do not attempt to sort the list yourself either.     For example, an input [1, 2, 3] should return an output of 2, since 2 is    the second largest integer in the list.     Note that when we say second largest, we do not mean second largest    distinct element. That means that [1, 2, 4, 4] should return 4, not 2.    """don't use any imports,or any dictionaries, or dictionary methods.and try-except statements

The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted.  The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here.    Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…

Write a function that will accept a list of integers and return the sum of the contents of the list(……if the list contains 1,2,3 it will return 6…..)

python:  def character_gryffindor(character_list):"""Question 1You are given a list of characters in Harry Potter.Imagine you are Minerva McGonagall, and you need to pick the students from yourown house, which is Gryffindor, from the list.To do so ...- THIS MUST BE DONE IN ONE LINE- First, remove the duplicate names in the list provided- Then, remove the students that are not in Gryffindor- Finally, sort the list of students by their first name- Don't forget to return the resulting list of names!Args:character_list (list)Returns:list>>> character_gryffindor(["Scorpius Malfoy, Slytherin", "Harry Potter,Gryffindor", "Cedric Diggory, Hufflepuff", "Ronald Weasley, Gryffindor", "LunaLovegood, Ravenclaw"])['Harry Potter, Gryffindor', 'Ronald Weasley, Gryffindor']>>> character_gryffindor(["Hermione Granger, Gryffindor", "Hermione Granger,Gryffindor", "Cedric Diggory, Hufflepuff", "Sirius Black, Gryffindor", "JamesPotter, Gryffindor"])['Hermione Granger, Gryffindor', 'James…

Binary Search of Strings1. Write a version of the selection sort algorithm presented in the unit, which is usedto search a list of strings.2. Write a version of the binary search algorithm presented in the unit, which isused to search a list of strings. (Use the selection sort that you designed aboveto sort the list of strings.)3. Create a test program that primes the list with a set of strings, sorts the list, andthen prompts the user to enter a search string. Your program should then searchthe list using your binary search algorithm to determine if the string is in the list.Allow the user to continue to search for strings until they choose to exit theprogram

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]

**Cenaage Python** Question: A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary. CODE: def sequentialSearch(target, lyst):     """Returns the position of the target item if found,     or -1 otherwise.     The lyst is assumed to be sorted in ascending order."""     position = 0     while position < len(lyst):         if target == lyst[position]:             return position         position += 1     return -1 def main():     """Tests with three lists."""     print(sequentialSearch(3, [0, 1, 2, 3, 4]))     print(sequentialSearch(3, [0, 1, 2]))     # Should stop at second position.     print(sequentialSearch(3, [0, 4, 5, 6])) if __name__ == "__main__":     main()

Need help with Python.   Paste indented code QUESTION 8 Implement the following:1) Define a function oddList() with an arbitrary parameter a.2) This function accepts any number of integer arguments.3) oddList() stores all odd numbers into a list and returns the list.4) Call the function with 1, 2, 3, 4, 5 as arguments.5) Print the result of the function call. Example Output[1, 3, 5]