Take as input str, a string. The string is a mathematical expression e.g. “[a + {b + (c + d) + e} + f]”. Write a recursive function which tests if the brackets in expression are balanced or not and returns a Boolean value. Print the value returned.
Input Format
Enter the string
Constraints
None
Output Format
Display the boolean result
Sample Input
[a+{b+(c+d)+e}+f]
Sample Output
true