Given two processes (conversion of postfix equation to infix notation and conversion of prefix notation to infix notation), which of the following is easier to implement?
(a) Both are easy to implement
(b) Conversion of postfix equation to infix equation is harder than converting a prefix notation to infix notation
(c) Conversion of postfix equation to infix equation is easier than converting a prefix notation to infix notation
(d) Insufficient data
The origin of the question is Application of Stacks in portion Application of Stacks of Data Structures & Algorithms I
The question was posed to me in unit test.