Java - It is preferable to use an edge list for small graph problems because of the simplified methods provided for the linked list class definitions. True or False?

Implement the Linked List using head and tail pointer. Interface (.h file) of LinkedList class is given below. Your task is to provide implementation (.cpp file) for LinkedList class. Interface: template<class Type> class LinkedList { private: Node<Type>* head;               Node<Type>* tail; <Type> data; public:                 LinkedList<Type>(); LinkedList<Type>(const LinkedList<Type> &obj); void sortedInsert(Type); Type deleteFromPosition(int position); //deletes the node at the particular position Type delete(int start,int end); //deletes the nodes from starting to ending position bool isEmpty()const; void print()const; ~LinkedList(); };   program in c++.

Use a SinglyLinked List to implement a Queuea. Define a Queue interface.b. Define a LinkedQueue class (Node class)..c. Define a Test class to test all methods help me make a test class  first code package LinkedQueue;   import linkedstack.Node;   public class SLinkedList<E> { private Node <E> head = null; private Node <E> tail = null; private int size = 0;     public SLinkedList() { head = null; tail = null; size = 0;   }   public int getSize() { return size;   } public boolean isEmpty() { return size == 0;   }   public E getFirst() { if(isEmpty()) { return null; } return head.getElement(); }  public E getLast() { if(isEmpty()) { return null; } return tail.getElement();  }  public void addFirst(E e) { Node<E> newest = new Node<>(e, null); newest.setNext(head); head = newest; if(getSize()==0) { tail = head; } size++;    }    public void addLast(E e) { Node<E> newest = new Node<>(e, null); if(isEmpty()) { head = newest; } else {…

C. package Final;   import java.util.HashSet;   public class LLCycle_FE {     public static void main(String[] args) {         Node head = buildLL();        // Given the above linked list write the 2 methods below (removeDuplicates and showLL)         System.out.printf("\n --------- ");         // This method will remove any duplicate LL nodes (that is, with the same color)         head = removeDuplicates( head );         showLL( head );       }        **public static Node removeDuplicates(Node head) {           return head;     }      ** private static void showLL(Node head) {          // ToDo: Output the entire linked list     }       private static Node buildLL() {         // Use this code to create your LL         Node head = new Node("Red", null);           Node n2 = new Node("Blue", null);         head.next = n2;           Node n3 = new Node("Green", null);         n2.next = n3;           Node n4 = new Node("Yellow", null);         n3.next = n4;           Node n5 = new…