Fill in the code to complete the following method for sorting a list. public static void sort(doublell list) public static void sort(doublel] list, int high) if (high >1 // Find the largest number and its index int indexfMax = 0; double max- list[0]; for (int i-1; i max) ( max- listl indexOfMax i; I/ Swap the largest with the last number in the list listfindexOfMax]- list[highl list[high] max; // Sort the remaining list sort(list, high-1) a. sort(list) b. sortllist, list.length) c. sort(list, list.length-1) d. sort(list, list.length-2) 48. Fill in the code to complete the following method for binary search. public static int recursiveBinarySearch(int] list, int key) int high = list.length-1; return public static int recursiveBinarySearchlint list, int key int low, int high) f if (low > high) //The list has been exhausted without a match return-low - 1;// Return-insertion point -1 int mid (low + high)/2; if (key