Which of the following is a way to achieve O(1) time complexity for both enqueue and dequeue operations by using a Python list as the concrete data structure? a) Implementing a circular buffer b) Using a priority queue c) Employing a doubly linked list d) Utilizing a stack