Consider the stack data structure, supporting two operations push and pop, as discussed in class.Suppose that for the above sequence, each letter (such as E) corresponds to a push of that letter ontothe stack and each asterisk (*) corresponds a pop operation on the stack. Show the sequence of valuesreturned by the pop operations

If the sequence of operations - push(1) push(2) pop push(1) push(2) pop pop pop push(2) pop are performed on a stack, the sequence of popped out values are ? Options 2 1 2 2 1 2 2 1 1 2 2 2 1 2 2

These operations are called on a Stack : push(8), push(1), push(6), push(7), pop(), pop(), pop(), push(2), pop(). What is the data at the top position?A7B6C8D2

Problem Statement:Write a program that implements the Stack Data structure using ArraysThe operations performed on the Stack arePushPopPeekInput format:The first line of input contains the number of operations to be performed on the stackThe next lines contain the integers separated by space in which the first integer indicates the operation to be performed and the second integer contains the element to be pushed.1 ---> indicates the Push2 ---> indicates the Pop3 ---> indicates the PeekOutput format:Display every element after performing the peek operationDisplay the stack after performing all operations at the end.Sample Test Case:Input:61 21 31 4231 5Output:35 3 2Explanation:1 2 ---> 2 will be pushed1 3 ---> 3 will be pushed1 4 ---> 4 will be pushed2 ---> Last element(4) is popped3 ---> peek operation is performed which results in printing the top element of the stack i.e 31 5 ---> 5 will be pushed6 Operations are completedTherefore one peek operation is performed so the output is 3 and the final stack 5 3 2Note:If the stack is empty and when pop and peek are performed first, proceed to the next operation without displaying and modifying anything in the stack.If the stack is empty and nothing is pushed to the stack, Print Empty at the end.Sample Test CasesTest Case 1:Expected Output:61 21 31 4231 535·3·2

Suppose that you start with an empty stack and interpret a letter to mean push and – to mean pop. Mark the sequences below that leave e at the bottom of the stack.1 pointa – b c – – d – e f g – ha – b c – d – e – f g – ha – b – c – d – e f g – ha b c d – – – – e f g – ha – b c – – d – e f g h –

A stack is implemented with an array of 'A [0..N - 1]' and a varlable 'pos'. The push and pop operations are defined by the following code.push(x) A[pos] ← X pos ← pos - 1end pushpop( ) pos ← pos + 1 return A[pos]end popWhich of the following will initialize an empty stack with capacity N for the above Implementation?