data structures using case val=popb()if(val!=- printf("\ the value popped from stack % ",val)breakcase printf("\ the contents of stack are \ ")display_stacka()breakcase printf("\ the contents of stack are \ ")display_stackb()break}while(option!= )getch()output *****main menu**** push in stack push in stack pop from stack pop from stack display stack display stack exit enter your choice enter the value to push on stack enter the value to push on stack enter your choice the content of stack are enter your choice underflow enter your choice applications of stacks in this section we will discuss typical problems where stacks can be easily applied for simple and efficient solution the topics that will be discussed in this section include the followingreversing list parentheses checker conversion of an infix expression into postfix expression evaluation of postfix expression conversion of an infix expression into prefix expression evaluation of prefix expression recursion tower of hanoi reversing list list of numbers can be reversed by reading each number from an array starting from the first index and pushing it on stack once all the numbers have been readthe numbers can be popped one at time and then stored in the array starting from the first index programming example write program to reverse list of given numbers #include