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}

What does the following pseudocode do?Stack S;while (!S.isEmpty()) {    S.pop();}Checks if the stack is emptyRemoves all elements from the stackPops one element from the stackPrints all elements of the stack

What will be the output of the following program?main() {    char str[]="san foundry";    int len = strlen(str);    int i;    for(i=0;i        push(str[i]);  // pushes an element into stack   for(i=0;i      pop();  //pops an element from the stack}

Sharon is developing a programming challenge for a coding competition. The challenge revolves around implementing a character-based stack data structure using an array.Sharon's project involves a stack that can perform the following operations:Push a Character: Users can push a character onto the stack.Pop a Character: Users can pop a character from the stack.Display Stack: Users can view the current elements in the stack.Exit: Users can exit the stack operations application.Write a program to help Sharon to implement a program that performs the given operations.Input format :The input consists of integers corresponding to the operation that needs to be performed:Choice 1: Push the character onto the stack. If the choice is 1, the following input is a space-separated character, representing the character to be pushed onto the stack.Choice 2: Pop the character from the stack.Choice 3: Display the characters in the stack.Choice 4: Exit the program.Output format :The output displays messages according to the choice and the status of the stack:If the choice is 1, push the given character to the stack and display the pushed character.If the choice is 2, pop the character from the stack and display the character that is popped.If the choice is 2, and if the stack is empty without any characters, print "Stack is empty. Nothing to pop."If the choice is 3, print the elements in the stack.If the choice is 3, and there are no characters in the stack, print "Stack is empty."If the choice is 4, exit the program.If any other choice is entered, print "Invalid choice"Refer to the sample output for the exact format.Code constraints :The maximum size of the stack is defined as 100.Choice: 1, 2, 3, or 4Sample test cases :Input 1 :24Output 1 :Stack is empty. Nothing to pop.Input 2 :1 A1 B234Output 2 :Pushed: APushed: BPopped: BStack elements: A Input 3 :94Output 3 :Invalid choiceInput 4 :1 A234Output 4 :Pushed: APopped: AStack is empty.Input 5 :1 X1 Y1 Z322224Output 5 :Pushed: XPushed: YPushed: ZStack elements: Z Y X Popped: ZPopped: YPopped: XStack is empty. Nothing to pop.

What is the output of the following code snippet?void solve() { stack<int> s; s.push(1); s.push(2); s.push(3); for(int i = 1; i <= 3; i++) { cout << s.top() << “ “; s.pop(); }}

What is the output of the following code snippet?std::stack<int> s;s.push(1);s.push(2);s.push(3);std::cout << s.size() << " " << s.top();3 13 22 33 3