![p. 4 out of 4 Exercise 3 [4 pts]. Describe carefully in English, or with a pseudocode, an algorithm that takes as input a ful](https://media.cheggcdn.com/media%2Fe6d%2Fe6d14372-0c5c-4289-a347-3d2c91e04b4c%2Fimage.png)
p. 4 out of 4 Exercise 3 [4 pts]. Describe carefully in English, or with a pseudocode, an algorithm that takes as input a fully parenthesized infix expression that contains, say, the digits 0, .9 and two binary operators on digits, e and ®, that may not be commutative, and outputs the same expression in prefix. NB. Prefix notation is the notation that has no parentheses and the operators precede their operands. Example:
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured