The group can solve the given problem in any of the following programming languages. a. (Python )
-You are assigned with the task of creating a list data structure implemented using pointers that will read the inputs from the user, where
You may choose to use any one of the following for your assignment,
o One-Way circular linked list
First node will have the count of the number of nodes available in the linked list (excluding the first node), initially the linked list will have 1 node with value 0 indicating zero nodes. The linked list will contain a mathematical expression given by the user during run-time. Your program must do the following o Check the input expression for Brackets/Parenthesis checking. o When the Brackets/Parenthesis checking is validated then convert the expression to its equivalent post-fix expression. o Replace the given input linked list with the postfix linked list while maintaining the node count (first node) Given Linked List (input) Infix ( A + B ) ^ 2 Output Linked List (output) Postfix A B + 2 ^
-PLEASE OPEN THE FILE FOR THE Scenario.
