Problem Statement : Implement stack as an abstract data type using singly linked list and use this ADT for conversion of infix expression to postfix, prefix and evaluation of postfix and prefix expression. Sample Input for Testing:

1. (a+b)*c
2. (a+b)/(c*d)
3. (a+(bc))/(c-(db))
4. ab/(c-d)+ef
5. (a-z)(b+c-de)*f */