Which of the given is not an application of Stack?Optionsevaluation of postfix expressionbalancing symbolsconvertion of Infix to Postfixnone

Select the correct answerWhich of the given is not an application of Stack?Optionsbalancing symbolsconvertion of Infix to Postfixnoneevaluation of postfix expression

In evaluating a postfix expression using stack, when an operator is found, ________Apop operations must be carried out Bpush operations must be carried outCcomparison with the top data must be carried outDboth operands must be displayed

Stacks are used for converting infix expressions to postfix expressions. What is the postfix form of the infix expression "A + B * C"?Group of answer choicesA B + C *A + B C *A B C * +B C * A +

Which of the following is an application of stack?a.finding factorialb.tower of Hanoic.infix to postfixd.all of the above

10. Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?a) 1b) 2c) 3d) 4