please answer asap

Here are some instructions to help you start working on the assignment (5) D Run 2 Online (1) Ahmed Mereb - The template uses Java generics to create a generic class Maln that can search for a key element in an array of any type that implements the Comparable interface. Generics are a way of implementing generic programming in Java, which allows you to write code that can work with different types of objects without casting or risking ClassCastException - The constructor of the Main class takes an array of type T as a parameter and assigns it to the array field. The array field is aiso of type T, which means it can store any type of object that implements Comparable. - The Linearsearch method returns an int that is the index of the key element in the array, of 1 if the key element is not found. The method uses a for loop to iterate over the array and compare each element with the key using the conpareto method of the conparabte interface. The compitieto method returns a negative integer, zero, or a positive integer if thecurrent object is less than, equal to, or greater than the specified object. For example, If you want to compare the element at index i with the key, you can write: if (array]1]. compareto (key) =0 ) ( 1) return the index TU] array: pubuc Main(TI) acray) \& this. array = array: public int Linearsearch (T key) f poblic int Binatysearchit key, int start, int iSearch method has a time complexity of O(n). Where n is the size of the array, because it may have to scan the Run S Oniline (3) Alinmed Mereb entire array to find the key element. - The -inarysearch mothod toturns an int that is the index of the key element in the array, or 1 if the key element is not found. The method uses a recursive approach to divide the array into smatier subarrays and compare the middle element of each subarray with the koy using the cospareTo method of the corparabte interface. The methed assumes that the array is sorted in ascending order. For example, if you want to compare the middle element of the subarray from start to end with the key, you can write: - The Binarysearch method has a time complewity of O(log nli. where n is the size ot the array, becsuse it foduces the search sace by half in each iteration. - To test your code, you can create an obpect of the Main class with different types of arrays, wech as tntegec, string. or Double, and call the Linearsearch and Binarysearch metheds on thein. You can point twe ker eloment and the index returned by the Points: 0/100 3earch in the left subarray l II search in the right subarray 8. 3 [ D) DRun Online (1) Ahmed Mereb - The BinarySearch method has a time complexity of O(logn), Main.java where n is the size of the array, because it reduces the search space by half in each iteration. - To test your code, you can create an object of the Main class with different types of arrays, such as integer, String, or Double, and call the LinearSearch and BinarySearch methods on them. You can print the key element and the index returned by the methods to check the output. For example, you can write: - The output should be: 1. Koy element: 4 2 Linear search index: 2 3. Binary search index: 2