In Java:

• Write two static genetic methods maxElement() and minElement(). The methods take an array of objects of an arbitrary type and find the largest and the smallest objects correspondingly. The type of objects must be limited to those that implement Comparable interface.
• Modify quicksort() implementation in such a way that it becomes a generic method and can work with objects that implement Comparable interface. Add it as a static method to GenericMethods class. Make this quicksort() have a boolean parameter that determines whether the array will be sorted in ascending or descending order. See examples below:

int[] array = {3, 5, 6, 1, 2, 4}; GenericMethods.quicksort(array, true); => {1, 2, 3, 4, 5, 6} GenericMethods.quicksort(array, false); => {6, 5, 4, 3, 2, 1}