Exercises 11-14 refer to another algorithm, called bubble sort, which sorts an n-element list. Bubble sort makes multiple passes through the list from front to back, each time exchanging pairs of entries that are out of order. Here is a pseudocode version: 1. Get values for n and the n list items 2. Set the marker U for the unsorted section at the end of the list 3. While the unsorted section has more than one element, do Steps 4 through 8 Set the current element marker Cat the second element of the list 4. 5. While C has not passed U, do Steps 6 and 7 If the item at position C is less than the item to its left, then exchange these two items 6 7. Move C to the right one position 8. Move U left one position 9. Stop