Write a stack class MATCH that gets a string from the user and uses a pointer-based stack to determine whether its parentheses are properly balanced/matched. For example, your program should print true for [()]{}{[()()]()} and false for [(]). Size of character in the strings of parentheses is less than 50. The valid chars are [,],{,},(,),<, and >. The strings of parentheses should not have space char. Note that this problem is simplified version of Expression Evaluation problem (pg. 128 and 129), where two stacks are used for operators and operand. However, this particular case does not deal with operations; therefore, only one stack is used. A solutions would push() an opening bracket into stack and pop() it once corresponding closing bracket.

A few examples are given below.

Enter a string: [()]{}{[()()]()}

True

Enter a string: [()]

True

Enter a string: [)(]

False

Enter a string: ((())

False