Generic Double Ended Queue
Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.
It is a mixture of both stack and queue.
A deque can perform the following operations:
3) delFront() # to delete the front item
4) delLast() # to delete the last item
Create a generic deque such that it contains the following items:
burger, chesse, 2018, 9, audi, cookies
You need to remove the last 2 elements and the first element.