9. What is the worst-case run-time complexity of inserting a new element into an array-backed list?

(a) O(1)

(b) O(log N)

(c) O(N)

(d) O(N^2)

10. What is the worst-case run-time complexity of retrieving an element based on its provided index from an arraybacked list?

(a) O(1)

(b) O(log N)

(c) O(N)

(d) O(N^2)

11. What is the worst-case run-time complexity of searching for an element with a given value in an unsorted arraybacked list?

(a) O(1)

(b) O(log N)

(c) O(N)

(d) O(N^2)

12. What is the worst-case run-time complexity of prepending a new element to a circular, doubly-linked list?

(a) O(1)

(b) O(log N)

(c) O(N)

(d) O(N^2)

13. What is the worst-case run-time complexity of removing the last element from a circular, double-linked list?

(a) O(1)

(b) O(log N)

(c) O(N)

(d) O(N^2)

14. What is the worst-case run-time complexity of concatenating two circular, doubly-linked lists? (Assume that copying either list is not a requirement.)

(a) O(1)

(b) O(log N)

(c) O(N)

(d) O(N^2)