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

Problem StatementTisha wants to learn mathematical expressions and she wants to create a program to accept multiple infix expressions from the user and convert them into postfix expressions using a Stack-based algorithm. The program should prompt the user to enter the number of expressions they wish to convert, and then accept each expression one by one. After converting each infix expression to a postfix, the program should print the corresponding postfix expression to the console. Input format :The first line of input consists of an integer N, denoting the number of infix expressions to be converted.The following N lines of input consist of the infix expressions to be converted.Output format :The N lines of output print "Postfix expression T: " where T is the expression number followed by the corresponding postfix expression for N inputs, in separate lines.Refer to the sample output for the formatting specifications.Code constraints :The maximum length of an infix expression is 100 characters.The program should support multiple infix expressions.The program should use a stack-based algorithm to convert infix expressions to postfix expressions.Sample test cases :Input 1 :1A+B*C-D/E^FOutput 1 :Postfix expression 1: ABC*+DEF^/-Input 2 :2A+B-CD+E/F-GOutput 2 :Postfix expression 1: AB+C-Postfix expression 2: DEF/+G-Input 3 :1a*(b+c)/d-eOutput 3 :Postfix expression 1: abc+*d/e-Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

Let X be the result when the below postfix expressionis evaluated:X = 4 5 1 + * 2 / 3 1 2 + * +Let Y be the maximum size of the operand stack, thevalue of X-Y is ________a.21b.23c.15d.17

What is the maximum number of symbols that appear on the stack atany point of time during the evaluation of this expression?

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 *B C * A +A B C * +A + B C * PreviousNext

Write a function to evaluate a postfix expression using a stack. The expression contains single-digit integers and the operators +, -, *, /.Constraints:NAExample:Sample Input:94*2/Sample Output:18Explanation:As only single operands are being considered, 9, 4, 2 are the operands and *, / are operators.After pushing 9 and 4 into the stack * operator was encountered. So, 9*4 = 36.Then, 36/2 will be 8.Public Test Cases:# INPUT EXPECTED OUTPUT1 94*2/18