1 hour left answer this fast

4. Create a class Deque and implement the functions of double ended queue All functions should run in O(1) a Write a function InsertRear that insats an element at the rear of the Deque. b. Write a function Get Rear that returns the last item from the Deque. c. Write a function DeleteRear that removes an item from the rear of Deque. class Degue: det init__(self): 17 your code goes here def InsertRear(self, value): // your code goes here def Get Rear (self): 17 your code goes here def DeleteRear(self): 17 your code goes here a. 3. Create a class LinkedList and add following functions. All function should run in O(n) Write a function Insert that takes two arguments x andj. Wherex andjare integers. The function should insert valuex at position j in the linked list. b. Write a function SearchByValue that takes an argument x. Wherex is an integer. The function should search the position of the valuex in the list and should return the position of the location. It should retum -1 if the value is not found. c. Write a function DeleteDuplicates that ddetes duplicate values from the linked list. The function should return a sorted list after deleting the duplicate values. class Node: der init (aelf, value): self.value - value self.next = None class Linkedlist: der init (self): self.head - None self.tail - None def Insert (self,x,j): // your code goes here def SearchByValue (sel:,x): // your code goes here der Delete Duplicates (self): // your code goes here