1. Create a class Deque and implement the functions of double ended queue. All functions should run in O(1).

1. Write a function InsertRear that inserts an element at the rear of the Deque.
2. Write a function GetRear that returns the last item from the Deque.
3. Write a function DeleteRear that removes an item from the rear of Deque.

class Deque:

def __init__(self):

// your code goes here

def InsertRear(self,value):

// your code goes here

def GetRear(self):

// your code goes here

def DeleteRear(self):

// your code goes here

python