Write a program that reads an mathematical expression in infix notation, and writes its equivalent in postfix,

a$.$k$.$a$,$ Reverse Polish Notation $($RPN$).$ The mathematical expression can contain the following operations $+,$

$,,/,$

$,(,$ and $).$ Among non$-$parenthesis symbols, $+$ and $$ have the lowest priority, and $$ has the highest

priority. As always, parentheses can modify the priority.