Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced:Which of these unbalanced sequences does the above code think is balanced?declare a character stack while $($ more input is available$)$read a characterif $($ the character is a $(1)$ push it on the stackelse if $($ the character is a $)$ and the stack is not emp ty $)$pop a character off the stack else print "unbalanced" and exit$]$print "balanced"O A$.(0))0$ B$.((0)$O c$.00$ D$.(00))$