Develop a Doubly-Linked-List, with the given Python file A1 B2 . 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 Sample console display output of executing the main texting program Ma1B2, PY =w =w A1B2, DLList program, by eStudent kAME> Stodent IDows. .1. List with Insert items 20>30>4e>5e>6e>70 Doubty-Linked-List Display, Backwards: FROM ... tail getNextFWDL(5e), elt:6e