in this assignment, have to complete the uncompleted program. please make that program work. thanks. I have uploaded 4 pictures of incompleted program. hope you read the side number I underline.

Develop a Doubly-Linked-List, with the given Python file A1B2 .Py. Each node in Doubly-Linked-List has two links: one for the next node as in singly-linked list, the other for the previous node. The head node has no previous link and the tail node has no next link. This is implemented as a Python class DLNode and given in our Python file. Some operations could be done for efficiently with this Doubly-Linked-List, which require tracing backward (the previous node of the current node). Given an uncompleted Doubly-Linked-List in A1B2.py (based on the one in our lecture notes, LList.py), with implemented methods below: Complete this Doubly-Linked-List with the Extra Operations below (methods of the class): At least one line of simple comment for each extra operation required self.tailN=None#thetailNode If simple cominent HERE def getNextFwDL (self, refElt): \# Get \& return (without nemove) next element of refenenee refelt, in forward order pass \# TO BE DONE BY STUDENT \# simple cominent HERE pass \# TO BE DONE BY STUDENT \# simple comment HERE def removeNextFwDL (se2f, pefElt): \# REMQVE \& petunn next elenent of nefenence nefelt, in forwand order pasS \# TD BE DONE BY STUDENT