Question 4 1 pts What is the expected performance for all deque operations for a doubly- linked implementation? O O(1) O O(n) O Odlog n) O O(n2) Question 5 1 pts Which ADT can best be described as a combination of a stack and a queue? stack O deque O queue O priority queue Question 6 1 pts What element does a priority queue use in order to organize elements? O positioning of the elements O priority of the elements O sorting of the elements O all elements are equal Question 7 1 pts A common alias for the queue method getFront is o peek O get O put O all of the above Question 4 1 pts What is the expected performance for all deque operations for a doubly- linked implementation? O O(1) O O(n) O Odlog n) O O(n2) Question 5 1 pts Which ADT can best be described as a combination of a stack and a queue? stack O deque O queue O priority queue Question 6 1 pts What element does a priority queue use in order to organize elements? O positioning of the elements O priority of the elements O sorting of the elements O all elements are equal Question 7 1 pts A common alias for the queue method getFront is o peek O get O put O all of the above