Doubly-Linked List . complete a part of this code ( student home work)

class DLNode: # modelling a node with doubly-linked def __init__(self, inValue=None, inPrev=None, inNext=None): # constructor self.value = inValue # the node data value, default None self.prevN = inPrev # the previous node, default None self.nextN = inNext # the next node, default None

class DLList: # defining a class of Doubly-Linked List def __init__(self): # GIVEN: constructor self.headN = None # the head Node self.tailN = None # the tail Node

###################### STUDNET's WORK ###################### # simple comment HERE def insertBefore(self, refValue, newV): # insert a new node, BEFORE the ref Node (value) pass # TO BE MODIFIED AND COMPLETED # simple comment HERE def insertAfter(self, refValue, newV): # insert a new node, AFTER the ref Node (value) pass # TO BE MODIFIED AND COMPLETED

# simple comment HERE def displayDLBackw(self): print(f">>> DOUBLY-Linked-List Display, Backwards: >") pass # TO BE MODIFIED AND COMPLETED

#################

Sample console display output of executing the main testing program Aonect.py === A1C, DLList program, by === --- 1. New DLL created >>> DOUBLY-Linked-List Display: > ... AN EMPTY LIST --- 2. Insert some items --- >>> DOUBLY-Linked-List Display: > head , tail : > 11 > 22 > 33 > 55 > 77 > 99 --- 3. insertAfter(55,66) >>> DOUBLY-Linked-List Display: > ... head , tail : > 11 > 22 > 33 > 55 > 66 > 77 > 99 --- --- 4. insertBefore(55,44) >>> DOUBLY-Linked-List Display: > ... head , tail 11 > 22 > 33 > 44 > 55 > 66 > 77 > 99 --- 5. insertAfter(77,88) >>> DOUBLY-Linked-List Display: > ... head , tail : > 11 > 22 > 33 > 44 > 55 > 66 > 77 > 88 >>> DOUBLY-Linked-List Display, Backwards: > FROM ... tail 99