QUESTION 25 Complete the methods for QuickSort: 1. Sort a part of the table using the quicksort algorithm. - epost The part of table from first through last is sorted. - eparam table the array to be sorted - eparam first the index of the low bound * eparam last The index of the high bound 1 private static > void quicksort (T[] table, int first, int last) ( if (first N elements using selection sort, how many key comparisons (the comparisons between elements) are needed (give the accurate express in term of N, not in Big O)? Symbol asterisk '*' used below represents multiplication. A. N2 B. N2/2 C. NlogN D. N(N1)/2