Attempt all 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.

kindly do it in proper way please its urgent do it as note is given the programming language must be c++ and oop and using data structure and linklist.