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 –

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

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?Optionspos ← N−1pos ← 0pos ← −1pos

Consider the following pseudocode that uses a stack. What is output for input "letsfindc"?  declare a stack of characterswhile ( there are more characters in the word to read ){read a characterpush the character on the stack}while ( the stack is not empty ){pop a character off the stackwrite the character to the screen}

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