Implement a self-organizing list by creating a singly linked list of nodes and undertaking frequent retrievals of data in the list repeatedly and at random. Show how the list restructures itself when (i) count, (ii) move to front and (iii) transpose methods are used for the same set of frequent retrievals.

Assume that the nodes of the singly linked lists are arranged in decreasing order of the exponents of the variable x in order to add the two polynomials.The objective is to create a fresh list of nodes that represents the addition of P1 and P2. This is done by adding the COEFF fields of nodes in lists P1 and P2 that have identical powers of variable x, and then making a new node in the resulting list P1 + P2. The key part of the technique is shown below.The start pointers of the singly linked lists that correspond to the polynomials P1 and P2 are P1 and P2, respectively. Two temporary pointers, PTR1 and PTR2, are created with starting values of P1 and P2, respectively. Make procedural code.

Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 3. Define TestSLinkedList Classa. Declare an instance of the Single List class.b. Test all the methods of the Single List class.

Suppose that you have a singly linked list with five nodes and with head reference. Then the statement head = head.next will remove the first node of the linked list? a) true  b) false