Question 1 1 pts A deque can best be described as a combination of which two data structures? O stack and list list and queue O stack and priority queue Ostack and queue Question 2 1 pts What is the expected performance of an enqueue operation if an array- based implementation is not full? O 0(1) O O(n) O O(log n) O O(n) Question 3 1 pts What is the expected performance of an enqueue operation if an array- based implementation is full? O(1) O O(n) O(log n) O O(n)