JAVA

A doubly linked list is circularly linked is the successor of the last node is the first, and the predecessor of the first node is the last. Working with circularly linked lists is similar to working with non-circularly linked list. The main differences are when you are adding to an empty list and when you are removing the lat node from a list.

Write a DoublyCircularlyLinkedList class to implement the doubly circularly linked list. The class should have the first and last reference to reference the first node and last node of the list. The class should have the following methods:

isEmpty: return true if the linked list is empty size: return the number of nodes in the linked list add: add a node to the end of the linked list add: add a node at a specific index remove: remove a node at a specific index remove: remove a node whose value is given as argument Then write a demo program to create a doubly circularly linked list and test the above methods in the demo program