Im having issues with this link list problem and cant figure it out. I need help thanks.

The fundamental data structure we will use to implement a token ring network is a circular doubly linked list. This is needed as we have to support both clockwise and counter-clockwise simulations. Your class must implement the DoublyCircularLinkedList interface found in the structures package. You will notice that this interface extends the CircularLinkedList interface, which in turm extends the interface ListInterface. You will notice that we have already provided you a starter class DoublyCircularLinkedList that extends DoublyCircularLinkedList in the structures package in the sre directory Kou will find several TODO comments where you are to complete this implementation You can add any additional instance variables to this class to complete your implementation. Some important items you should take note of are the getNext0 and getPreviousO methods. The getNextO method will returm the info for the current node and advance the location reference forward. The getPrevious) method will advance the location reference backwards and then return the info for the current node Related to these methods is the resetO method. This method will reset the location reference to the head node (the first node). In our implementation of a doubly circular linked list your location reference should always point to the first node That is, if we add the first node to the list you should make sure to update your location reference to point to that first node. The fundamental data structure we will use to implement a token ring network is a circular doubly linked list. This is needed as we have to support both clockwise and counter-clockwise simulations. Your class must implement the DoublyCircularLinkedList interface found in the structures package. You will notice that this interface extends the CircularLinkedList interface, which in turm extends the interface ListInterface. You will notice that we have already provided you a starter class DoublyCircularLinkedList that extends DoublyCircularLinkedList in the structures package in the sre directory Kou will find several TODO comments where you are to complete this implementation You can add any additional instance variables to this class to complete your implementation. Some important items you should take note of are the getNext0 and getPreviousO methods. The getNextO method will returm the info for the current node and advance the location reference forward. The getPrevious) method will advance the location reference backwards and then return the info for the current node Related to these methods is the resetO method. This method will reset the location reference to the head node (the first node). In our implementation of a doubly circular linked list your location reference should always point to the first node That is, if we add the first node to the list you should make sure to update your location reference to point to that first node