Java Implement 5 methods given below in  MyStringArrayList class  // Add a new element, e, at the beginning of this list         public void addFront(String e){ } //search for element e, returns true if found, otherwise returns false.         public boolean contains(String e){ } //return the element at position i, otherwise returns null         public String getElement(int i){ } // remove the element at specified index, returns the element that is being removed.  Returns null if specified index is invalid.         public String removeElementAt(int i){ } //returns a String representation of this list.         public String toString(){ }

JAVA plese Implement the indexOf method in the LinkedIntegerList class      public int indexOf(int value);        /**     * Returns whether the given value exists in the list.     * @param value - value to be searched.     * @return true if specified value is present in the list, false otherwise.     */ }     public static void main(String[] args) {        // TODO Auto-generated method stub        SimpleIntegerListADT myList = null;         System.out.println(myList);        for(int i=2; i<8; i+=2) {            myList.add(i);        } System.out.println(myList.indexOf(44));

Java language Use arrays in creating your class. Stack Interface (LIFO) void push(Object)  Object pop() String toString() boolean isEmpty() boolean equals(Object) getIndexOf get remove   private static void arrayListTests() { System.out.println("ArrayList Tests"); // todo: make more tests here ArrayList a = new ArrayList(); System.out.println("Check empty array isEmpty:" + a.isEmpty()); a.insert('B', 0); a.insert('a', 0); a.insert('t', 1); System.out.println("Check non-empty array isEmpty:" + a.isEmpty()); System.out.println(a.toString()); while (a.isEmpty() == false) { System.out.println(a.remove(0)); }   // Fill over initial capacity and check that it grows for (int i = 0; i < 110; i++) { a.append(new Integer(i)); } System.out.println("Size of array after 110 adds: "+ a.size()); System.out.println("Value of last element: "+ a.get(a.size()-1)); System.out.println("Insert past end of list"); a.insert('z', 200); System.out.println("Insert negative index"); a.insert('z',  -3);…

JavaTimer.java: import java.util.Arrays;import java.util.Random; public class JavaTimer { // Please expand method main() to meet the requirements.// You have the following sorting methods available:// insertionSort(int[] a);// selectionSort(int[] a);// mergeSort(int[] a);// quickSort(int[] a);// The array will be in sorted order after the routines are called!// Be sure to re-randomize the array after each sort.public static void main(String[] args) {// Create and initialize arraysint[] a = {1, 3, 5}, b, c, d;// Check the time to sort array along startTime = System.nanoTime();quickSort(a);long endTime = System.nanoTime();long duration = (endTime - startTime) / 1000l;// Output resultsSystem.out.println("Working on an array of length " + a.length + ".");System.out.println("Quick sort: " + duration + "us.");}// Thanks to https://www.javatpoint.com/insertion-sort-in-javapublic static void insertionSort(int array[]) {int n = array.length;for (int j = 1; j < n; j++) {int key = array[j];int…

Exercise 2: Consider the following class: public class Sequence { private ArrayList values; public Sequence() { values = new ArrayList(); } public void add(int n) { values.add(n); } public String toString() { return values.toString(); } } Add a method public Sequence merge(Sequence other) that merges two sequences, alternating ele- ments from both sequences. If one sequence is shorter than the other, then alternate as long as you can and then append the remaining elements from the longer sequence. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then a.merge(b) returns the sequence 1 9 4 7 9 4 16 9 11 without modifying a or b.