Question 1 (2 points) Select the matching Big-O notation for each of these array-based Stack methods: pop 2. Ollog n) 3. O(n) 4. O(n log n) puslh peek vis empty Question 2 (3 points) Select the matching Big-O notation for each of these array-based Queue methods: len vis_empty 2. (log n) 3. O(n) 4. O(n log n) peek insert remove is full Select the matching Big-U notation tor each ot these array-based Priority Queue methods: split_key vis empty 2. (log n) 3. O(n) 4. O(n log n) 5. O(nA2) insert remove split alt peek Question 4 (3 points) Select the matching Big-O notation for each of these array-based Circular Queue methods: _len is empty 2. (log n) 3. O(n) 4. O(n log n) 5. (n2) is full vremove peek insert