Which of the following are true about the implementation for the array-based queue? Select one or more: 1. If the end of the queue is in the last position of the underlying list, then enqueue) will 2. If the end of the queue is in the last position of the underlying list, then enqueue) will 3. To remove an item from the queue, we only need to set the form to the next element in 4. To remove an item from the queue, we only need to set the front to the next element in 5. The array-based queue is implemented with the underlying storage in a list, And this list allocate a new double-sized list only when the current lust is full allocate a double sized list immediately the queue None the queue None is used in a circular fashion to make better use of memory space. Which of the following are true about deque? Select one or more: 1. We could add elements to both ends of deque 2. Deque is a double-ended queue 3. We could add elements to one end of the queue and remove elements from the other end of the queue. Which end should we add or remove depends on what types of deque we instantiate 4. We could remove element from both ends of deque. Which of the followings is true about stack? Select one: 1. The insertion and deletion follow the First-In-Last-Out scheme 2. The insertion and deletion follow the First-In-First-Out scheme 3. There is no restrictions on add and remove elements to a stack. What elements do we have in the stack S after we perform the following instructions? S-ArrayStack() S.push(5) S.push(3) S.top0 2. None of them 3. [3] 4. [5,3