1) A pointer variable which contains the location at the top element of the stack is called. A. Top B. Last C.Final D. End 2) Which of the following is application of stack? maing factorialB. tower of Hanoi C. infix to postfx ( all of the above 3) The elements are removal from a stack in D Sequential A. Reverse BHierarchical C. Alternative order. 4. PSEUDOCODE for empty stack is A. isEmpty): B. isEmpty) C.isEmpty): D.isEmpty0. 5. PSEUDOCODE to add new items in the stack is A. push (newEntry) B.push (newEntry) C. push 0: D. push e braces are balanced if, when you reach the end of the string, you have matched each D. none stacks and queues are implemented as arrays 7. A. Dynamic D. Nonlinear C. Circular B. Static D.Static 8. Advantage of using array in stack A. Higher latency C. Best performance B. Fixed size . If path exists, we can find a path from any city C, to another city C2 using a stack . True B. False high priority 10. In queue, priority value mean high value True B. False Which of the following is correct for the priority Queue tem: prioritys B. C. (item, priority) D. citem priority e queue B. dequeue queues C. enqueue dequeues eue is a ist B)FIFO list C) Ordered array D) Linear tree e STL provides two containers,_ andfor implementing que in a queue an