Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced: declare a character stackwhile $($ more input is available$)$read a characterif $($ the character is a $\text{'}(\text{'})$push it on the stackelse if $($Ithe character is a $\text{'})\text{'}$and the stack is not empty $)$pop a character off the stack elseprint "unbalanced" and exitprint "balanced"Run on IDEWhich of these unbalanced sequences does the above code think is balanced?