A double-ended-queue (Deque) is a queue in which items can be inserted at or deleted from either end. I want you to implement a deque in PYTHON, first using circular arrays and then using doubly linked lists. The purpose here is for me to understand how to build a deque on my own so please add lots of comments so that I can understand what is happening on each line of the code. Also, highlight the pros and cons of both implementations at the end.