Lab #4 – recursive methods for generic arraylist lab objectives • be able to write a java method for an arraylist of generic type, as specified by a type parameter. be able to make use of recursion on arraylist based on the splicing technique be able to write a driver to call the methods developed for testing • deliverables submit the report in word or pdf format with the results of every task listed below. they should show screen capture of your results. the problem use recursion to implement some list functionalities on an arrraylist of generic type using type parameters in method definition our goal for this lab is to continue using the divide and conquer approach of splitting a list into its head and tail and keep recursing on the tail (which happens to be smaller). however, instead of trying the approach on a string (a list of characters) we would like to use an arraylist of an arbitrary type of list element, parameterized by e. we can still use the same design outline as the previous lab exercise (lab 3). note the following prototype declaration for the arraylist class: public class arraylist extends abstractlist implements list, perform the following tasks in a class called listrecursive task #1 develop a recursive method to reverse a list develop a method with the prototype public static void reverse (arraylist inputlist) based on selecting the first list element as the head and the remaining list as its tail. here is the recursive design. 1) base case: the problem is trivial when the list size is 0 or 1. 2) decomposition: for lists with size > 1: a) extract its head (element) and leave the tail (the input list with the head removed). you can look up the method that does this for the list interface. b) make a recursive call to obtain the tail reversed. 3) composition: append the extracted head element to the reversed tail obtain the original list reversed. task #2 develop a recursive method to find the maximal element note that this is not possible unless the list elements are comparable to each other. java provides a generic interface for this called comparable. based on this, develop a method with the following prototype public static > e max (list inputlist) you can use the same problem decomposition technique as in task #1. think about how the composition of result should be made. task #3 develop a recursive method to sum the list elements obviously, this is not possible unless the list elements are of numeric type. develop a recursive summing method with the prototype public static double sum (list inputlist) task #4 use command line arguments to supply the list elements use the following main() method: public static void main(string args[]) { arraylist arglist = new arraylist< > (); arraylist numericargs = new arraylist< > (); for (strings : args) { arglist. add(s); try { numericargs. add(double. parse double(s)); catch (number formatexception e) { system. out. println(e. getmessage() + "is not "); system. out. print("command line arguments before reversal: "); for (int i=0; i