[Algorithms by Robert Sedgewick] - Solution for problem 1.3.4

Given below is solution to problem 1.3.4 from Algorithms 4th Edition by Robert Sedgewick

1.3.4 Write a stack client Parentheses that reads in a text stream from standard input and uses a stack to determine whether its parentheses are properly balanced. For example, your program should print true for [()]{}{[()()]()} and false for [(]).