in python

A Deque is a linear data structure which behaves like a double-ended queue, i.e., it allows adding or removing items from either the front or the rear of the Deque. The Node Way and Node classes can be used to dynamically create storage for each new item added to a Deque using a doubly-linked implementation as in: DoublyLinkedDeque Object front: previous data next a' previous data next 'b' previous data next 'ch previous data next 'd rear: size: Deque doubly-linked 4 Complete the removeRear method for the above DoublyLinkedDeque implementation include code to check the precondition. def removeRear (self): **** Removes and returns the Rear item of the deque Precondition: The deque is not empty. Postcondition: the rear item is removed and return from the deque