Look for a point where two (singly) linked lists intersect. Return the intersection node. Remember that the intersection is defined by reference rather than value. If the kth node of the first linked list is the exact same node (by reference) as the jth node of the second linked list, then they are intersecting.

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

Given a linked list of N nodes ..

Add more methods to the doubly 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 first code below  package DlinkedList;public class DLinkedList<A,B,C> {    private Node<A,B,C> header;    private Node<A,B,C> trailer;    private int size;        public DLinkedList() {        header = new Node<>(null, null, null);        trailer = new Node<>(null, null, null);        header.setNext(trailer);        trailer.setPrev(header);            }    public int getSize() {        return size;    }    public boolean isEmpty() {        return size==0;    }    public A…