we have an array implementation of the stack class, with ten items in the stack through data[9). The CAPACITY is 42. Where does the push method place the 32. Suppose new entry in the array? at data[0] A. data[O] B. data(1] C. data(9) D. datal10] A linked list is composed of objects that each point to 34. In the linked-list version of the Stack class, which operations require linear time for their B. peek C. pop D. push E. None of these operations require linear time 35. In inserting a node in the front of a linked list, the order of operations is crucial. Given that front points to the first node in the list and that element points to the element to be inserted, which of the following is the correct sequence of operations. A. front.next- element element.next front B. element.next-front.next front.next element element-next front front element I am going to execute this code with THREE pushes and ONE pop: Stacks-new LinkedStack