Hey everybody I need help with this code from a book I am learning! It is in java. All comments on code will help a lot! Thanks!

Implementing Dynamic Circular Doubly Linked List with a dummy healer node In order to make traversing, inserting and removing modes from d list more ellicienL Lhe often created with h nod g links to both its and its alled ad ked list. This list so that within the any point istyo an travel completely around the list To avoid the special case of inserting and removing from the empty list a cincular douhly linked st usually uses a dummy header node. This node is creatod when the list is created and is NOT part of one which only contans the dummy sst. All empty list node. Your to impl he accompanying specificat for a circular douhl ked list assignment is a dummy cader node This list should be nn ondered list. The implementation you are to create atch the supplied specificat not be changed