Sort the list and show the steps in table. details based on the given tracking Show the value of low, high, indexOfMin, min, swapping and the call. The first function call is sort(list, 0, list.length...

int [] list = {43,81,7,46,50,14,26} and the length = 7

Extracted text: Sort the list and show the steps in table. details based on the given tracking Show the value of low, high, indexOfMin, min, swapping and the call. The first function call is sort(list, 0, list.length - 1); The source code is eprivate static void sort(int [] list, int low, int high) { eif (low < high)="" {="" find="" the="" smallest="" number="" and="" its="" index="" in="" list(low="" ..="" high)="" int="" indexofmin="low;" min="list[low];" int="" efor="" (int="" i="low" +="" 1;="" i=""><= high;="" i++)="" {="" if="" (list[i]="">< min)="" {="" min="list[i];" indexofmin="i;" }//="" if="" }//="" for="" swap="" the="" smallest="" in="" list(low="" list[indexofmin]="list[low];" list[low]="min;" sort="" the="" remaining="" list(low+1="" sort(list,="" low="" +="" 1,="" high);="" }//="" outer="" if="" }="" end="" of="" function="" high)="" with="" list(low)="" ..="" high)="" indexofmin="low" min="list[low]i" list[i]="">< low="" high="" if="">< high)="" list="" min="indexOfMin" =i;="" min="" list[i]="" swapping:="" list[indexofmin]="">