$1)$ Using a Pthyon program and a simple sorting algorithm is called a "Bubble Sort" because elements bubble around through the list. It is also called a "Sinking Sort" because the larger values "sink" to the end $($bottom$)$ of the list. A bubble sort iterates through a list and swaps adjacent pairs if they are in the wrong order. The sort continues until all elements are correctly ordered.

Example: bubbleSort$([0,1,8,4,3,2,9])-$ as it begins to process will compare $0$ and one and make no change, then $1$ and $8$ again no change, then $8$ and $4$ and swap them. This process would repeat until we get $[0,1,2,3,4,8,9]$

Are there any improvements you can make of the basic implementation?

Write an implementation of a bubble sort

$2)$ Determine the Computational Complexity of your implementation