Identify the correct algorithm for reverse traversal in the doubly-linked list studentList. Group of answer choices   ListTraverseReverse(students) { curNode = students⇢head while (curNode is not null) { Print curNode's data curNode = curNode⇢next } }   ListTraverseReverse(students) { curNode = students⇢head while (curNode is null) { Print curNode's data curNode = curNode⇢prev } }   ListTraverseReverse(students) { curNode = students⇢tail while (curNode is not null) { Print curNode's data curNode = curNode⇢next } }   ListTraverseReverse(students) { curNode = students⇢tail while (curNode is not null) { Print curNode's data curNode = curNode⇢prev

Add more methods to the singly linked list class then test them• search(e) // Return one node with 3 values (stuID, stuName, stuScore) which matches agiven key e (studentID).• addAfter(e, stuID, stuName, stuScore) //Add a new node with 3 values (stuID,stuName, stuScore) after the node with the key e (studentID).• removeAt(e) //Remove a node which matches a given key e (studentID)• count() //Return a number of nodes of list.• update(stuID, stuName, stuScore) //Update the values of one node three codes below two in pictures one,typed out. public class SlinkedList<A,B,C> {    private Node head;    private Node tail;    private int size;        public SlinkedList(){        head=null;        tail=null;        size=0;    }        public int getSize(){        return size;    }        public boolean isEmpty(){        return size == 0;            }    public A getFirstStuId(){    if(isEmpty())        return null;    return (A) head.getStuID();}public B getFirstStuName(){    if(isEmpty())…

Describe how to construct a doubly linked list.

In a linked list, devise an approach that will remove all nodes with the same key.