2. (15 points) Insertion sort. Trace the operation of insertion 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. a. template void insertionSort (vector v) for (int i-l; i0&& v[j- 1] > temp) v[j-temp; index Origiafterafter after afte after v after teration terationiteration teration iterationiteration 4 4 4 b. Please analyze the number of comparisons (vIj - 1] 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 insertion sort algorithm to sort all items in a vector with n items. > temp) required in the the worst case the best case # of comparisons