Given this algorithm: We can use a stack to check pattern matching, For example we can use a stack to determine if all parentheses are matched in an equation. When an open parentheses ( is parsed from the string, it is pushed on the stack and when a close parentheses is parsed ), the stack is popped. O0CO)) What conditions will the algorithm be in to demonstrate that the parentheses are mismatched? D The algorithm is incorrect and cannot determine if there is a mismatch. If you read a) and pop the stack-only to find the stack was empty and the pop failed. This will indicate that there are too man closing parentheses If you finish parsing/reading the input string and the stack is empty. This indicates that the number of parentheses was incorrect as all the ) should be on the stack at the end When we read a ( and pop the stack for a ) a (is returned instead. This demonstrates an imbalance. If you finish parsing/reading the input string and your stack is NOT empty, this will idicate that there are too many opening parentheses