Postfix Expression Evaluation Problem Statement

Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expression should be the result modulo (10⁹+7). Use modular division when necessary.

Example:

Explanation:

Infix expression: A + B * C - D
Postfix expression: A B + C D - *

Input:

The first line contains an integer ‘T’ representing the number of test cases.
Each of the next ‘T’ lines contains one postfix expression.

Output:

For each test case, print the integer result of evaluating the given postfix expression.

Constraints:

• The first line of input contains an integer ‘T’ such that 1 ≤ T ≤ 100
• Each postfix expression has a length ‘N’ such that 1 ≤ N ≤ 10³
• The operands in the expression are represented by integers ‘NUM’ such that 1 ≤ NUM ≤ 100
• Operators include: '*', '/', '+', '-'
• Operators and operands are separated by a space
• No brackets are present in the postfix expression

Note:

You do not need to print the expected output; just implement the function.