Attempt the questions by using C++ and OOP. Data Structures (Link List or ADT).

Develop a program for expression parsing. The program will perform following operations:

1. Take Infix notation and process them.

2. Take Postfix notation and process them.

3. Take Infix notation, convert them to Prefix notation and process them.

do it as note is given kindly do it in data structure using linklist