Write a Java generic sort function, the generic sort function takes an array of objects as input and sorts them in place. You can assume that the objects the array do implement the Comparable Interface, in other words, obj1.compareTo(obj2) returns-1,0, or 1 if objt is less than, equal or greater than obj2. respectively. You are free to pick any sorting algorithm (bubble sort, insertion, heap sort, etc.).

You are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index. Write code with explanation

In writing a general-purpose sort method in Java, the sort method needs to compareobjects. There are two ways to give the sort method the code to compare objects,implementing the interfaces Comparable and Comparator respectively. Extend Article class toimplement Comparable interface so that the default sorting of the Articles is by its volume

1. Write a linear (0(n)) running time complexity program in Java to find all the dominant elements in the given array of n distinct integer elements. An element is a dominant element if it is greater than all the elements to its right side. The rightmost element in the array is always a dominant element. For example, in the array {16, 17, 4, 3, 5, 2}, dominant elements are 17, 5 and 2. 2. Prove that your algorithm takes (0(n)) running time to compute this task. Formulate the sum equation for this proof.