PLEASE HURRY! I only have 30 minutes for these questions. thank you!

Question 1 (1 point) Which one of the following is an application of Stack Data Structure? Managing function calls Backtracking problems: eg 8 Queens or maze problem Evaluating mathematical expressions All of the above Question 2 (1 point) Which of the following is true about linked list implementation of stack? In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end. In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning Both of the above None of the above Consider the following pseudocode that uses a stack declare a stack of characters while ( there are more characters in the word to read ) read a character push the character on the stack while ( the stack is not empty) pop a character off the stack write the character to the screen What is output for input "serendipity" serendipityserendipity ytipidneres serendipity ytipidneresytipidneres