Question 8 Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced: Not yet answered Marked out of 2.00 declare a character stack Flag question while (more input is available) { read a character if (the character is a ) push it on the stack else if the character is a) and the stack is not empty) pop a character off the stack eise print "unbalanced" and exit print "balanced push it on the stack else if ( the character is a) and the stack is not empty) pop a character off the stack else print "unbalanced" and exit print "balanced" Which of these unbalanced sequences does the above code think is balanced? Select one: O A. ((0) OBOCO O C. (00) O D. (0)