Given two linked lists sorted in increasing order, write a static method named to return a new list representing the intersection of the two lists. The new list should be made with its own memory – the original lists should not be changed. The method will be invoked like this: LinkedList list3 = list1.intersection (list2); Example: If L1 = 4 →15 →18→ 23 → 45 → 78 →102 And L2 = 3 →4→ 18 → 20 → 45→92 So the new list L3= 4 →18→ 45 public static LinkedList intersection (LinkedList list){

A computing algorithm is a set of instructions or a process for solving computational problems. In other words, it contains a set of rules that indicate the step-wise process to solve a problem. The algorithm takes a set of inputs, executes the instructi…