12. Dry run with this code that will take values 8,7,2,5,3 and mention the name of the algorithms. void Sort(int numbers[ ], int array_size) { int i, j; int min, temp; for (i = 0; i

Extracted text: 12. Dry run with this code that will take values 8,7,2,5,3 and mention the name of the algorithms. void Sort(int numbers[ ], int array_size) { int i, j; int min, temp; for (i = 0; i< array_size-1;="" i++)="" {="" min="i;" for="" (j="i+1;">< array_size;="" j++)="" {="" if="" (numbers[j]="">< numbers[min])="" min="j;" }="" temp="numbers[i);" numbers[i]="numbers[min];" numbers[min]="temp;">