1. Assuming enough storage is available, what is the running time to add an item in an unsorted array? (b) O(logn) (c) O(n) (d) O(n2) 2. What is one disadvantage of storing data in an array? (a) Cannot use binary search (b) It takes O(n) time to access an item in the middle of the array (c) If the array is full and we want to add another item, it takes O(n) time to allocate a new array and copy the data (d) all of the above 3. When a linked list is used to implement a stack, what is the running time for the push and pop operations? (a) O(1) to push and O(n) to pop (b) O(n) to push and O(1) to pop (c) O(n) to push and O(n) to pop (d) O(1) to push and O(1) to pop