Nodes The linked list consists of nodes. A class CircularSinglyLinkedListNode is provided to you. This class has getter and setter methods to access and mutate the structure of the nodes. Adding You will implement three add$()$ methods. One will add to the front, one will add to the back, and one will add to anywhere in the list given a specific index. See the javadocs for more details. Removing You will also implement three remove$()$ methods $-$ from the front, the back, or anywhere in the list given a specific index. Make sure that there is no longer any way to access the removed node so that the node will be garbage collected. See the javadocs for more details. Garbage Collection Java will automatically mark objects for garbage collection based on whether there is any means of accessing the object. In other words, if we want to remove a node from the list, we must remove all references to that node. What the next reference of that node points to doesn$$t particularly matter. As long as no references can reach the node, the node will be garbage collected eventually.