Points We can use a stack to check whether a given string has balanced parentheses or not. If you see an opening parenthesis, push it into the stack. If you see a closing parenthesis, pop the top element (if exists) from the stack and check whether the popped element and the closing parenthesis are a matched pair. After you have dealt with all characters in the given string, it turns out that the stack is not empty. Which of the following will result in the non-empty stack?
a. (1+3)5+(6+8)3)
b. ((4+79(2+6)+8)"9
c. 14+5(8-2)(3+73)
d. 2+(3+6)*(6/5)