please answer the problem using java and with comments for understanding.. also follow the istruction of the question. requesting the screenshot of result window.

thanks

Comparator super E> comparator) (Generic quick sort) Write the following two generic methods using quick sort. The first method sorts the elements using the Comparable interface, and the second uses the Comparator interface. 23.3 public static > void quickSort (EI] list) public static void quickSort (E[] list, Comparator super E> comparator) 23.4 (Improve quick sor) The quick-sort algorithm presented in the book selects the first element in the list as the pivot. Revise it by selecting the median among the