[PYTHON]

I need help with exercise two. The output must match the example.

the function starts with this:

def bubble_sort(numList):

Exercise 1 3 pts. Insert 96,12,6,14,42,36,59,10,26 into an empty hash table of size using a) Linear Probing [1 pt] b) Linear Probing with a +3 probe l pt] c) Quadratic Probing [1 pt] Exercise 2 17 pts. As discussed in class, bubble sort is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. Write the function bubble_sort numList) that takes an unsorted list of numbers and uses the bubble sort algorithm to return the sorted list. The function should also print the state of the list after each pass. EXAMPLES >>> bubble sort ([2,3,5,4,1]) #printed values. Each printed value must be a list [1, 2, 3, 4, 5] #returned value Depending on your implementation, this is another valid output: >> bubble sort ([2,3,5,4,1]) [2, 3, 1, 4, 5]| #printed values. Each printed value [2, 1, 3, 4, 5]-must be a list [1, 2, 3, 4, 5] #returned value