data structures in java

Write a method called Compare AndChangelist to be included in an application class called ListApplication that accepts two parameters list1 and list of type Single Linked List of integer values, and a third parameter Item of type int. If list and list2 are of different sizes, the method retums false, otherwise, the method replaces any element in list with a value equal to the last element in list1, if the summation of the element in list 1 and the corresponding element in list2 is equal to item. Assume list and list2 are not empty. If at least one replacement happened, the method retums true, otherwise, it returns false Note: Write this method by calling methods of the class SingleLinkedlist. Method head public static boolean CompareAndChange List (Singlelinked List integer ist1, SingleLinkedlist integer Ist2, In Item) Examples Before Method call item = 35 list1:23 20 30 2012 st2 10 9 25 154 After Method call st: 23 26 30 2017 52 10 17 25 17 4 in this case, the method will return true Note: as you can see the summation of 26 (in list 1) and its corresponding element in list219, is 35, which is equal to item, so we replace the element in list 291 by the value of the last date in listi which is 17. The same thing is between the elements 20 fin list 1) and 15 in list 21.15 is going to be replaced by 17. The rest will not change