You are implementing a calculator application that uses reverse polish notation. A user enters the expression "3 4 + 2 *". What should be the result?a)16b)10c)7d)14

You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation.Evaluate the expression. Return an integer that represents the value of the expression.Note that:The valid operators are '+', '-', '*', and '/'.Each operand may be an integer or another expression.The division between two integers always truncates toward zero.There will not be any division by zero.The input represents a valid arithmetic expression in a reverse polish notation.The answer and all the intermediate calculations can be represented in a 32-bit integer. Example 1:Input: tokens = ["2","1","+","3","*"]Output: 9Explanation: ((2 + 1) * 3) = 9

12345678910111213141516171819#include <stdio.h> void calc(double *result, double a, double b) { *result = (a * a) + (2 * a * b) + (b * b); } int main() { double res; calc(&res, 3.0, 4.0); printf("%.2lf", res); return 0; }

What is the outcome of the prefix expression +, -, *, 3, 2, /, 8, 4, 1?a.10b.11c.5d.4

You are implementing a stack-based calculator. Your calculator should take a string that represents a mathematical expression in postfix notation (also known as reverse Polish notation) and return the result of the calculation. For example, the input "2 3 +" should return 5, and "5 2 - 3 *" should return 9. Construct a logic to evaluate the mathematical expression.Input format :The input consists of a single line of mathematical expression string separated by a space.Output format :The output prints the result of the expression evaluation.If the input has expressions other than + - * /, return the output as -1.Refer to the sample output for formatting specifications.Code constraints :Allowed arithmetic expressions: + - * /Sample test cases :Input 1 :2 7 +Output 1 :9Input 2 :6 4 - 2 *Output 2 :4Input 3 :1 2 @Output 3 :-1Input 4 :2 3 +Output 4 :5Input 5 :5 2 - 3 *Output 5 :9Note :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.

Single File Programming QuestionProblem StatementYou are implementing a stack-based calculator. Your calculator should take a string that represents a mathematical expression in postfix notation (also known as reverse Polish notation) and return the result of the calculation. For example, the input "2 3 +" should return 5, and "5 2 - 3 *" should return 9. Construct a logic to evaluate the mathematical expression.Input format :The input consists of a single line of mathematical expression string separated by a space.Output format :The output prints the result of the expression evaluation.If the input has expressions other than + - * /, return the output as -1.Refer to the sample output for formatting specifications.Code constraints :Allowed arithmetic expressions: + - * /Sample test cases :Input 1 :2 7 +Output 1 :9Input 2 :6 4 - 2 *Output 2 :4Input 3 :1 2 @Output 3 :-1Input 4 :2 3 +Output 4 :5Input 5 :5 2 - 3 *Output 5 :9