written in java

The following is an incorrect implementation of an algorithm to determine matched braces as one would find in a mathematical expression. declare a stack of character while( more input is available) read a character if (the character is a ) push the character onto the stack else if (the character is a and the stack isn't empty pop a character off the stack else { print "unbalanced" exit 11 end while print "balanced" Consider each of the following sequence of braces. Indicate if the code above would label it "unbalanced" or "balanced". Make sure to explain your answer. (5 points each) b) c) d) 3) (A)) +)))) e) Rewrite the code above so that it works correctly (10 points). You may write in java or pseudocode