Hi i need an implementation on the LinkListDriver and the LinkListOrdered for this output :Enter your choice: 1Enter element: MaryList Menu Selections1. add element2_remove element3.head element4. display5.ExitEnter your choice: 3Element @ head: MaryList Menu Selections1-add element2-remove element3_head element4.display5-ExitEnter your choice:41. MaryList Menu Selections1. add element2. remove element3.head element4. display5. ExitEnter your choice:LinkedListDriverpackage jsjf;import java.util.LinkedList;import java.util.Scanner;public class LinkedListDriver { public static void main(String [] args) { Scanner input = new Scanner(System.in); LinkedList list = new LinkedList(); int menu = 0; do { System.out.println("
List menu selection
1.Add element
2.Remove element
3.Head
4.Display
5.Exit"); System.out.println(); System.out.print("Enter your choice: "); menu = Integer.parseInt(input.next()); switch (menu) { case 1: System.out.print("Enter Element: "); String Element = input.next(); break; case 2: System.out.print("Enter Element: "); Element = input.next(); break; case 3: System.out.print("Enter Element: "); Element = input.next(); break; case 4: System.out.print("Enter Element: "); Element = input.next(); break; } } while (menu != 5); // iterates until 5 (Exit) is entered input.close(); }}Linear Nodepackage jsjf;public class LinearNode{ private LinearNode next; private E element; /** * Creates an empty node. */ public LinearNode() { next = null; element = null; } public LinearNode(E elem) { next = null; element = elem; } public LinearNode getNext() { return next; } /** * Sets the node that follows this one. public void setNext(LinearNode node) { next = node; } /** * Returns the element stored in this node. * * @return the element stored in this node */ public E getElement() { return element; } /** * Sets the element stored in this node. * * @param elem the element to be stored in this node */ public void setElement(E elem) { element = elem; }}LinkedOrderedListpackage jsjf;import java.util.Iterator;import java.util.Spliterator;import java.util.function.Consumer;import jsjf.exceptions.*;public class LinkedOrderedList extends LinkedListimplements OrderedListADT{public LinkedOrderedList() { super(); }public void add(T element, LinearNode tail) { if (!(element instanceof Comparable)) { throw new NonComparableElementException("LinkedOrderedList"); } else { Comparable comparableElement = (Comparable)element; LinearNode head = null; LinearNode current = head; LinearNode previous = null; LinearNode newNode = new LinearNode(element); boolean found = false; if (isEmpty()) // list is empty { head = newNode; tail = newNode; } else if (comparableElement.compareTo(head.getElement()) = 0)// element goes at tail { tail.setNext(newNode); tail = newNode; } else // element goes in the middle { while ((comparableElement.compareTo(current.getElement()) 0)) { previous = current; current = current.getNext(); } newNode.setNext(current); previous.setNext(newNode); } int count = 0; count++; int modCount = 0; modCount++; } } @Override public T removeFirst() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T removeLast() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T remove(T element) { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T first() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T last() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public boolean contains(T target) { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public boolean isEmpty() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public int size() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public Iterator iterator() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public void forEach(Consumer action) { OrderedListADT.super.forEach(action); //To change body of generated methods, choose Tools | Templates. } @Override public Spliterator spliterator() { return OrderedListADT.super.spliterator(); //To change body of generated methods, choose Tools | Templates. } @Override public void add(T element) { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. }}Linked List //Explanation is added in commentsimport java.util.Scanner;public class LinkedList {Scanner keyboard = new Scanner(System.in);//head will represent starting pointNode head; // head to store starting point of listprivate class Node{ // nested class to define nodesint data;Node next;}public void build(){System.out.println("Enter number of nodes in the list.
");int N=keyboard. nextInt(); // N is number of nodesLinkedList list=new LinkedList();for (int i=0;i extends LinkedListimplements OrderedListADT{public LinkedOrderedList() { super(); }public void add(T element, LinearNode tail) { if (!(element instanceof Comparable)) { throw new NonComparableElementException("LinkedOrderedList"); } else { Comparable comparableElement = (Comparable)element; LinearNode head = null; LinearNode current = head; LinearNode previous = null; LinearNode newNode = new LinearNode(element); boolean found = false; if (isEmpty()) // list is empty { head = newNode; tail = newNode; } else if (comparableElement.compareTo(head.getElement()) = 0)// element goes at tail { tail.setNext(newNode); tail = newNode; } else // element goes in the middle { while ((comparableElement.compareTo(current.getElement()) 0)) { previous = current; current = current.getNext(); } newNode.setNext(current); previous.setNext(newNode); } int count = 0; count++; int modCount = 0; modCount++; } } @Override public T removeFirst() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T removeLast() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T remove(T element) { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T first() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public T last() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public boolean contains(T target) { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public boolean isEmpty() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public int size() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public Iterator iterator() { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. } @Override public void forEach(Consumer action) { OrderedListADT.super.forEach(action); //To change body of generated methods, choose Tools | Templates. } @Override public Spliterator spliterator() { return OrderedListADT.super.spliterator(); //To change body of generated methods, choose Tools | Templates. } @Override public void add(T element) { throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates. }}OrderedListADT.javapackage jsjf;public interface OrderedListADT extends ListADT{ /** * Adds the specified element to this list at the proper location * * @param element the element to be added to this list */ public void add(T element);}

Question

Hi i need an implementation on the LinkListDriver and the LinkListOrdered for this output :Enter your choice: 1Enter element: MaryList Menu Selections1. add element2_remove element3.head element4. display5.ExitEnter your choice: 3Element @ head: MaryList Menu Selections1-add element2-remove element3_head element4.display5-ExitEnter your choice:41. MaryList Menu Selections1. add element2. remove element3.head element4. display5. ExitEnter your choice:LinkedListDriverpackage jsjf;import java.util.LinkedList;import java.util.Scanner;public class LinkedListDriver {        public static void main(String [] args)        {                Scanner input = new Scanner(System.in);                LinkedList list = new LinkedList();                int menu = 0;                do {                        System.out.println(&#34;
List menu selection
1.Add element
2.Remove element
3.Head
4.Display
5.Exit&#34;);                        System.out.println();                        System.out.print(&#34;Enter your choice: &#34;);                        menu = Integer.parseInt(input.next());                                                                     switch (menu) {                        case 1:                    System.out.print(&#34;Enter Element: &#34;);                    String Element = input.next();                                break;                        case 2:                             System.out.print(&#34;Enter Element: &#34;);                    Element = input.next();                    break;                        case 3:                              System.out.print(&#34;Enter Element: &#34;);                    Element = input.next();                                break;                        case 4:  System.out.print(&#34;Enter Element: &#34;);                    Element = input.next();                                break;                        }                } while (menu != 5); // iterates until 5 (Exit) is entered                input.close();        }}Linear Nodepackage jsjf;public class LinearNode{    private LinearNode next;    private E element;    /**     * Creates an empty node.     */    public LinearNode()    {        next = null;        element = null;    }    public LinearNode(E elem)    {        next = null;        element = elem;    }      public LinearNode getNext()    {        return next;    }    /**     * Sets the node that follows this one.    public void setNext(LinearNode node)    {        next = node;    }    /**     * Returns the element stored in this node.     *     * @return the element stored in this node     */    public E getElement()    {        return element;    }    /**     * Sets the element stored in this node.     *     * @param elem the element to be stored in this node     */    public void setElement(E elem)    {        element = elem;    }}LinkedOrderedListpackage jsjf;import java.util.Iterator;import java.util.Spliterator;import java.util.function.Consumer;import jsjf.exceptions.*;public class LinkedOrderedList extends LinkedListimplements OrderedListADT{public LinkedOrderedList()   {       super();   }public void add(T element, LinearNode tail)   {            if (!(element instanceof Comparable))                {                    throw new NonComparableElementException(&#34;LinkedOrderedList&#34;);                }            else                {                    Comparable comparableElement = (Comparable)element;                LinearNode head = null;                    LinearNode current = head;        LinearNode previous = null;        LinearNode newNode = new LinearNode(element);        boolean found = false;      if (isEmpty()) // list is empty                        {                            head = newNode;            tail = newNode;                        }                    else if (comparableElement.compareTo(head.getElement()) = 0)// element goes at tail                        {                            tail.setNext(newNode);            tail = newNode;                        }                    else // element goes in the middle                        {                            while ((comparableElement.compareTo(current.getElement()) > 0))                                {                                    previous = current;                current = current.getNext();                                }                            newNode.setNext(current);            previous.setNext(newNode);                        }                int count = 0;                    count++;                int modCount = 0;        modCount++;                }   }    @Override    public T removeFirst() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T removeLast() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T remove(T element) {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T first() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T last() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public boolean contains(T target) {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public boolean isEmpty() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public int size() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public Iterator iterator() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public void forEach(Consumer action) {        OrderedListADT.super.forEach(action); //To change body of generated methods, choose Tools | Templates.    }    @Override    public Spliterator spliterator() {        return OrderedListADT.super.spliterator(); //To change body of generated methods, choose Tools | Templates.    }    @Override    public void add(T element) {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }}Linked List //Explanation is added in commentsimport java.util.Scanner;public class LinkedList {Scanner keyboard = new Scanner(System.in);//head will represent starting pointNode head; // head to store starting point of listprivate class Node{ // nested class to define nodesint data;Node next;}public void build(){System.out.println(&#34;Enter number of nodes in the list.
&#34;);int N=keyboard. nextInt(); // N is number of nodesLinkedList list=new LinkedList();for (int i=0;i extends LinkedListimplements OrderedListADT{public LinkedOrderedList()   {       super();   }public void add(T element, LinearNode tail)   {            if (!(element instanceof Comparable))                {                    throw new NonComparableElementException(&#34;LinkedOrderedList&#34;);                }            else                {                    Comparable comparableElement = (Comparable)element;                LinearNode head = null;                    LinearNode current = head;        LinearNode previous = null;        LinearNode newNode = new LinearNode(element);        boolean found = false;      if (isEmpty()) // list is empty                        {                            head = newNode;            tail = newNode;                        }                    else if (comparableElement.compareTo(head.getElement()) = 0)// element goes at tail                        {                            tail.setNext(newNode);            tail = newNode;                        }                    else // element goes in the middle                        {                            while ((comparableElement.compareTo(current.getElement()) > 0))                                {                                    previous = current;                current = current.getNext();                                }                            newNode.setNext(current);            previous.setNext(newNode);                        }                int count = 0;                    count++;                int modCount = 0;        modCount++;                }   }    @Override    public T removeFirst() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T removeLast() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T remove(T element) {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T first() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public T last() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public boolean contains(T target) {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public boolean isEmpty() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public int size() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public Iterator iterator() {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }    @Override    public void forEach(Consumer action) {        OrderedListADT.super.forEach(action); //To change body of generated methods, choose Tools | Templates.    }    @Override    public Spliterator spliterator() {        return OrderedListADT.super.spliterator(); //To change body of generated methods, choose Tools | Templates.    }    @Override    public void add(T element) {        throw new UnsupportedOperationException(&#34;Not supported yet.&#34;); //To change body of generated methods, choose Tools | Templates.    }}OrderedListADT.javapackage jsjf;public interface OrderedListADT extends ListADT{    /**     * Adds the specified element to this list at the proper location     *     * @param element the element to be added to this list     */    public void add(T element);}

Accepted Answer

Hi i need an implementation on the LinkListDriver and the LinkListOrdered for this output : Enter…