Consider the following Insertion Sort algorithm and the array of integers provided - then answer the questions below: private static void InsertionSort (int[] List, int NrEl) { 0 1 } for (int i = 0; i < NrEl 1; i++) { } 2 for (int j = i + 1; j > 0; j--) { } 3 if (List[j-1] > List[j]) { } 4 int temp List[j-1]; List[j- 1] = List[j]; List[j] = temp; 5 6 80 60 11 31 17 9 6 a. Will the Sort above sort the list in ascending or descending order? b. Give the contents of the array after pass (each iteration of the outer for loop)