CODE IN JAVA AND USE THE COMPARATOR LIBRARY with these two functions and variables:

public static > void quickSort(final List list, final Comparator comparator) { // TODO } public static > void quickSort(final T[] array, final Comparator comparator) { // TODO }

Implement the Quicksort algorithm for both generic lists and generic arrays

Provide the theoretical, best, worst and average time complexity in Big O notation, as well as providing an explanation as to how each of those time complexities were determined.

Provide four potential decisions/optimizations that can be made to the base Quicksort algorithm. Explain each one provided.