Please code in PYTHON. Use either circular array based implementation or doubly linked list based implementation of deque. Add comments so that I can understand each and everything about the code and become self-sufficient in the concepts. Please give your best efforts, understanding this is very important to me!

PROBLEM 2 A double-ended-queue (Deque) is a queue in which items can be inserted at or deleted from either end One example where a deque can be used is the A-Steal job scheduling algorithm. This algorithm implements task scheduling for several processors. A separate deque with threads to be executed is maintained for each processor. To execute the next thread, the processor gets the first element from the deque (using the "remove first element" deque operation). If the current thread forks, it is put back to the front of the deque ("insert element at front") and a new thread is executed. When one of the processors finishes execution of its own threads (1.e. its deque is empty), it can "steal" a thread from another processor: it gets the last element from the deque of another processor ("remove last element") and executes it./ An input-restricted deque is one where deletion can be made from both ends, but insertion can be made at one end only. An output-restricted deque is one where insertion can be made at both ends, but deletion can be made from one end only. Implement all the possible operations of the Deque. Print the following outputs on the console: 1. Input Restricted Deque 2. Output Restricted Deque Enter your choice : 1 1. Enqueue 2. Dequeue Right 3. Dequeue Left 4. Display 5. Exit 1. Input Restricted Deque 2. Output Restricted Deque Enter your choice : 2 1. Enscheuerisht 2. Enqueue Left 3. Dequeue 4. Display 5. Exit