The reverse polish notation equivalent to the infix expression
((A + B) * C + D)/(E + F + G)

Question

The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G)

Accepted Answer

Correct answer: A — Final reverse polish notation: A B + C * D + E F + G + / Conversion steps: Convert the numerator ((A + B) * C + D): compute A B + (for A + B), then multiply that result by C to get A B + C *, then add D to get A B + C * D +. Convert the denominator (E + F + G): using left-associative addition, write E F + G + (this is equivalent to E F G + + as well). Place the denominator after the numerator and apply the division operator: A B + C * D + E F + G + /. Note: Ensure operators and operands are separated by spaces so each token is unambiguous.

Answer

A. A B + C * D + EF + G + /

Answer

B. A B + C D * + E F + G + /

Answer

C. A B + C * D + E F G + +/

Answer

D. A B + C * D + E + F G + /

The reverse polish notation equivalent to the infix expression ((A + B) * C +…