1 Which function places an element on the stack? (a) Add (b) Push 1c)Peek0 --(d) None of the above 2 In the linked list mplementation 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) Stack (c) Linked List (b) Queue (d) Array 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. datal1) D. datal6) S 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 6In the array version of the stack class (with a fixed-sized array), which operations require notn linear time for their worst-case behavior? 7 In the array version of the stack class (with a fixed-sized array), which operations require no linear time for their worst-case behavior? A. pash C. pop B. peck 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 10 The peck operation displays the toprmost value and delete it from the stack? b) False a) True