Q1: (CLO 3) Design and Implement a new Java Application to manage a sorted Double Linked Lists Create Node class a) b) Create MyDoubleLikedList class and write methods to Add methods to get and set, Data and Link . Insert nodes . Delete nodes Search List for a value Display all values in the nodes Display all values in the nodes in reverse order. Create 3 lists: listl, list2, list3 of type MyDoubleLikedList Write a method to generate randomly numbers between 20 and 60 . c) Create Main class . i. Insert 10 integers (do not insert duplicates) into listl ii. Insert 15 integers (do not insert duplicates) into list2 Write a method to find the average of the even numbers in a list Given two lists, write a method to find the elements that are in one of the list but not in the other list and insert them into a third list. Test these methods. . Q2: Given the single linked list created in the class: a) Modify the method search to be recursive b) Modify the method print to be a recursive c) A recursive method to count the number of negative numbers- countNegative0 d) Create a main program to test your methods. 03 (CLO 1) Create an interactive Java Application that uses recursion to solve the following: + (x" / n!), Where n and a) Calculate the value ofe1x /1!) + (x2/2:)(x/3!) + x are supplied by the user. You must call 2 recursive methods (One for factorial and another one for power (do not use pow method available in java). b) Implement a recursive method, called vowels, that returns the number of vowels in a string. c) Write a recursive method to implement Newton method to find the square root of a nonnegative real number whithin a given tolerance. If you do not know Newton method here is a short description: Suppose x is a nonnegative real number, a is the approximate square root of x, and epsilon is the tolerance. Start with a -x; if a*a-xkepsilon, then a is the square root of x within the tolerance; otherwise replace a by (a*atx)/(2*a) and where la*a-xl denotes the absolute value of a*a-x. a, x, epsilon are given by the repeat, user