Write a Python program to solve the following data structures problem ( Use only Python programming language )

Task 2: Checking for Balanced Delimiters in an Infix Algebraic Expression (Contents and images taken from [1]D The second task of the lab is to check whether a given mathematical expression (in infix notation) has balanced delimiters (i.e. parenthesis: (), square brackets: [l, and braces: 0 ). An expression with balanced delimiters should have the opening and closing delimiters in corresponding order with proper nesting. For example following are some expressions with balanced delimiters. (12 23) (12 (23 -2) [ 11 (12-2)* 5]) (12+(23 -2))* [11+ (12-2)*5] Some examples of expressions with unbalanced delimiters are shown below. (12+23: Closing parenthesis missing - (12+ 23)): Additional closing parenthesis - 12 (23 -2) + 11): Order of closing delimiters is wrong (I12+15+(11 10)1): Closing square bracket (after 10) missing You are expected to implement an algorithm which will allow you to check whether a given expression contains balanced delimiters. First you should try to do some examples on paper and