1 Which function places an element on the stack? (a) AddO (c) Peek0 (b) Push0 d) None of the above 2In the linked list implementation of the stack, where does the push member function place the new entry on the linked list? A At the head B. At the tail C. After all other entries that are greater than the new entry. D. After all other entries that are smaller than the new entry 3 Disks piled up one above the other represent a (a) Stack (c) Linked List (b) Queue (d) Array 4 Suppose we have an array implementation of the stack class, with 5 items in the stack stored at data [0] through data [4]. The CAPACITY is 8. Where does the push member function place the new entry in the array? A. data[0] C. data[5] B. data[1] D. data[6] 5 Which of the following stack operations could result in stack underflow? A. insert C. push B. pop D. Two or more of the above answers 6 In the array version of the stack class (with a fixed-sized array), which operations require non- linear time for their worst-case behavior? 7 In the array version of the stack class (with a fixed-sized array), which operations require non- linear time for their worst-case behavior? A. push C. pop B. peek D. None of these operations require non-linear time. is called a LIFO (Last-in-First-out) Pop 0 is used to add an element on the bottom of the Queue? True False The peek operation displays the topmost value and delete it from the stack? a) True 10 b) False