how do i create a method that adds instances from a class into a singly linked list(java)

Instruction: To test the Linked List class, create a new Java class with the main method, generate Linked List using Integer and check whether all methods do what they’re supposed to do. A sample Java class with main method is provided below including output generated. If you encounter errors, note them and try to correct the codes. Post the changes in your code, if any. Additional Instruction: Linked List is a part of the Collection framework present in java.util package, however, to be able to check the complexity of Linked List operations, we can recode the data structure based on Java Documentation https://docs.oracle.com/javase/8/docs/api/java/util/LinkedList.html package com.linkedlist;   public class linkedListTester {          public static void main(String[] args) {              ListI<Integer> list = new LinkedList<Integer>();              int n=10;              for(int i=0;i<n;i++) {                     list.addFirst(i);              }              for(int…

Java Programming language Help please.

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));

Java related to linked list finding max see image below

Can you please answer this fast and with correct answer. Thankyou

What is an iterator? Why are iterators often used with linked lists?

Starter code for ShoppingList.java   import java.util.*;import java.util.LinkedList; public class ShoppingList{    public static void main(String[] args)    {        Scanner scnr=new Scanner(System.in);        LinkedList<ListItem>shoppingList=new LinkedList<ListItem>();//declare LinkedList        String item;        int i=0,n=0;//declare variables        item=scnr.nextLine();//get input from user        while(item.equals("-1")!=true)//get inputuntil user not enter -1        {            shoppingList.add(new ListItem(item));//add into shoppingList LinkedList            n++;//increment n            item=scnr.nextLine();//get item from user        }        for(i=0;i<n;i++)        {            shoppingList.get(i).printNodeData();//call printNodeData()for each object        }    }} class ListItem{    String item;        //constructor    ListItem(String item)    {        this.item=item;    }        void printNodeData()    {        System.out.println(item);    }}

Please fill in all the code gaps if possible: (java) public class LinkedList {     privateLinkedListNode head; **Creates a new instance of LinkedList** public LinkedList () { } public LinkedListNode getHead() public void setHead (LinkedListNode head) **Add item at the front of the linked list** public void insertFront (Object item) **Remove item at the front of linked list and return the object variable** public Object removeFront() }

Which best describes this axiom: aList.getLength ( ) = ( aList.remove ( i ) ) . getLength ( ) + 1     You cannot remove an item from from existing list that is empty      Removing an item from an existing list decreases its length by one     Removing an item from an existing list increases the list size by one     None of these