Generate test cases for the following code by using Basic Path Testing. void sort(int a[ ],int N) { int i,j,p,t; for(i=0;i

write the following usong for loops

JAVA The following code for InsertionSort is given to us by the textbook. Trace the code stepby step using the array[55, 22, 77, 99, 66, 33, 11]on a piece of paper or using a Word document. If the code has errors, correct it and make itwork.public static void insertionSort(double[] list) {for (int i = 1; i < list.length; i++) {/** insert list[i] into a sorted sublist list[0..i-1] so thatlist[0..i] is sorted. */double currentElement = list[i];int k;for (k = i - 1; k >= 0 && list[k] > currentElement; k--) {list[k + 1] = list[k];}// Insert the current element into list[k+1]list[k + 1] = currentElement;}}

void func(vector<string>& names){   sort(names.begin(), names.end());       //(a)   for(int i = names.size() - 1; i > 0; --i){.  //(b)     if(names[i] == names[i - 1]){        names[i] = move(names.back());        names.pop_back();     }   } } What are the reasons or consequences for the programmer’s choice to loop backwards in the line marked (b), and under what circumstances would the algorithm behave differently if that line were replaced with: for (int i = 1; i < names.size(); ++i) ?   What would change?