Write C++ program using a 1D array of size 10, stack (for operators) and queue (for operands) methods to change infix notation to prefix.

The recognized operators are +, -, *, and /. Recognized operands are the letters a to z or the letters A to Z.

Scan infix from right to left. Input infix assumption is valid. All brackets and spaces are ignored.

Example output:

Input infix (max 10 characters without spaces and brackets ) = a*b+c/d

Prefix result = +*ab/cd W