Question: 1. Perform the bubble sort algorithm on a line of bubbles with sizes 2.3, 6.4, 1.2, 7.9, 5.5, 3.4, 2.9, 5.7.
2. Given bubbles of sizes 1 through 9, place them in an order that would take the bubble sort algorithm the largest number of switches to complete.
3. Write pseudo code for the bubble sort algorithm.
4. Implement the bubble sort algorithm in your favorite programming language.
5. Challenge: Design a more efficient sorting algorithm (where more efficient means using fewer than 
. steps in a worst-case scenario).