4. (15 points) Bubble sort. Trace the operation of the bubble sort algorithm when sorting the vector vector v= {8, 6, 2, 7, 9, 4, 3} . Please fill the table to show the changes of the vector v after each iteration. The first column is filled. template void a. bubblesort (vector v) for (inti-0; i vl1]) and the number of swaps (v[j] and vlj 1])) required in the worst case (the key of items in the vector are arranged from the highest to the lowest) and the best case (the key of items in the vector are arranged from the lowest to the highest), when using the bubble sort algorith m to sort all items in a vector with n items. # of comparisons | # of swaps the worst case the best case