Evaluating Numerical Expressions

In this project, you'll take on the role of a software developer tasked with creating an algorithm to evaluate complex numerical expressions input as strings. The challenge is that the expressions are in infix notation (operators between operands), which computer processors cannot innately handle. Your job is to enable evaluating these expressions. You'll use data structures like stacks and concepts like postfix notation (operators after operands) to solve this. The Shunting-yard algorithm will be implemented to convert expressions from infix to postfix notation. Then you'll evaluate the postfix expressions using stacks. All of this will be implemented in Python. Completing this project will grow your skills in working with stacks, implementing complex algorithms, converting between infix and postfix notation, and evaluating expressions. You'll gain valuable experience for software development roles and enhance your portfolio. Objective: Implement an algorithm using stacks in Python to evaluate complex numerical expressions input as strings.