(2) Write a stack client, Parentheses, that takes as argument an array of characters from the alphabet "[](){}" and uses a stack to determine whether the parentheses are properly balanced. For example, your program should print true for [()]{}{[()()]()} and false for [(]).

(Note: I'm requesting pseudocode, not compiling Java ... but you may find it valuable to implement your ideas in Java to test them)