Given two linked lists sorted in increasing order, write a method intersection( ) 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 c

JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:

JAVA plese Implement the indexOf method in the LinkedIntegerList class      public int indexOf(int value);        /**     * Returns whether the given value exists in the list.     * @param value - value to be searched.     * @return true if specified value is present in the list, false otherwise.     */ }     public static void main(String[] args) {        // TODO Auto-generated method stub        SimpleIntegerListADT myList = null;         System.out.println(myList);        for(int i=2; i<8; i+=2) {            myList.add(i);        } System.out.println(myList.indexOf(44));

Given the source code of linked List, answer the below questions(image): A. Fill out the method printList that print all the values of the linkedList: Draw the linked list. public void printList() { } // End of print method B. Write the lines to insert 10 at the end of the linked list. You must draw the final linked List. Notice that you can’t use second or third nodes. Feel free to define a new node. Assume you have only a head node C. Write the lines to delete node 2. You must draw the final linked list. Notice that you can’t use second or third node. Feel free to define a new node. Assume you have only a head node