Develep a Doubly-Linked-List, with the given Python fik A1B2.py. Each node in Doubly-Linked-List has two links: one for the next node as in singly-linked liss, the other for the peevioas node. The head node has no previous link and the tail node has no next link. This is implemented as a Pythoe class DLNode and given in our Python file. Some operations could be done for efficiently with this Dowbly-Limked-Liss, which require tncing backward (the previous node of the current node). Given an uncompleted Doubly-Liaked-List in A182, py (hased on the out in aur fecture notes, LList. pyl, with implemented methods below: Complete this Doubly-Linked-Lig with the Extra Operations below (methods of the class): At least one line of simple comment for each extra eperanion required Sample console display outiput of erecuting the main ierting program Ma.182, PY ALis2, DLList pregram, by estudent Kve? estudent. IDons ... 1. List with Insert itens 420,36,40,50,60,70. p) Doustr-Limed-List Display: o ... head e203, tail e7es: 20>3e>40>50>6e>7e Dountr-Linked-List Display, Backuards: s FRON ... tail Whead 20>39>50>6e>70 see Doustr-Linked-1ist Display, Backwards: FROH ... tail c?es, bead