Please help with this Python problem.

3. A deque is a double-ended queue. It combines the features of a stack and a queue. Imple- ment a deque in python. It should have the following methods: Deque() creates a new deque that is empty. It needs no parameters and returns an empty deque. addFront(item) adds a new item to the front of the deque. It needs the item and returns nothing addRear(item) adds a new item to the rear of the deque. It needs the item and returns nothing removeFront() removes the front item from the deque. It needs no parameters and returns the item. The deque is modified. removeRear() removes the rear item from the deque. It needs no parameters and returns the item. The deque is modified. Empty() tests to see whether the deque is empty. It needs no parameters and returns a boolean value. size() returns the number of items in the deque. It needs no parameters and returns an integer. In comments, describe the running time of each method of your implementation