Please write a Java method as described, not a complete program or class. ABABRintersectLanguage/Type:Related Links:3Java ArrayList collectionsArrayListWrite a method named intersect that accepts references to two sortedArrayList of integers as parameters and returns a new list that contains only theelements that are found in both lists. For example, if list list1 and list2 store:(1, 4, 8, 9, 11, 15, 17, 28, 41, 59){4, 7, 11, 17, 19, 20, 23, 28, 37, 59, 81)Then the call of intersect(list1, list2) returns the list: (4, 11, 17, 28, 59)Note that you can assume that both lists passed store their elements in sorted order.Do not modify the two lists passed in as parameters.

The answer of this question is as follows:Answer: public class Test { public static void main(String... args) throws Exception { List<String> list1= new ArrayList<String>(Arrays.asList[1, 4, 8, 9, 11, 15, 17, 28, 41, 59]); List<String> list2 = new ArrayList<String>(Arrays.asList[4, 7, 11, 17, 19,20, 23, 28, 37, 59, 81]): System.out.println(new Test().intersect(list1, list2)); System.out.println(new Test().union(list1, list2)); } public <T> List<T> union(List<T> list1, List<T> list2) { Set<T> set = new HashSet<T>(); set.addAll(list1); set.addAll(list2); return new ArrayList<T>(set); } public <T> List<T> intersect (List<T> list1, List<T> list2) { List<T> list = new ArrayList<T>(); for (T t : list1) { if(list2.contains(t)) { list.add(t); } } return list; } } or public static ArrayList<Integer> intersect(ArrayList<Integer> list1, ArrayList<Integer> list2) { ArrayList<Integer> res = new ArrayList(); for (int var: list1) { if(list2.contains(var)) res.add(var); } return res; }