self check given the following sequence of stack operationswhat is the top item on the stack when the sequence is completem stack( push(' ' push(' ' pop( push(' ' peek( ' ' ' the stack is empty given the following sequence of stack operationswhat is the top item on the stack when the sequence is completem stack( push(' ' push(' ' push(' 'while not is_empty() pop( pop( ' the stack is empty an error will occur 'zwrite function rev_string(my_strthat uses stack to reverse the characters in string simple balance parentheses we now turn our attention to using stacks to solve real computer science problems you have no doubt written arithmetic expressions such as ( ( )/( where parentheses are used to order the performance of operations you may also have some experience programming in language such as lisp with constructs like (defun square( ( ) the stack abstract data type