This is Java Programming Linked List Basics ( insertFront, insertBack, deleteFront & deleteBack) Question: Given the following code in main and output, please write the Java program which allows main to work: public static void main(String[] args) { LinkedList list = new LinkedList(); // Try to delete from an empty list list.deleteFront(); list.displayLL(); list.deleteBack(); list.displayLL(); // insert 3 nodes list.insert(18); list.insert(45); list.insert(12); list.displayLL(); // Here are the main “new” lines, not included in code I gave you list.insertFront(1); list.displayLL(); list.insertBack(999); list.displayLL(); list.deleteFront(); list.displayLL(); list.deleteBack(); list.displayLL(); } // end of main This is Java programming ple

Given the following class declaration: class List { public: List(); List(const List&); List& operator=(const List&); -List(); // Inserts element in the specified position, returns true if // it was able to insert. // Example, if the list is [4, 2, 1], and the user // calls list.Insert(6, 1) the list would become [4, 6, 2, 1] bool Insert(double element, size_t position) ; // Returns the position of element if found, if not found returns -1 int Index0f(double element)const ; // Removes the element in the given position double Remove(size_t position) ; // Gets the number in the given position double Get(size_t position)const ; // Returns a string representation of the list, elements // separated by commas and the list between brackets string ToString()const ; // Returns the number of elements in the list size_t Size)const; // Returns true if the list is empty, false otherwise bool IsEmpty)const; // Clears the whole list void Clear(); private: struct Node{ double number; Node* next; };…

IN JAVA PLEASE, need help finding an element in the list     /**     * 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 int indexOf(int value) {        //Implement this method                return -1;    }

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() }