1. Programming with Stacks Write a program that uses Stacks to determine if a line written with parentheses is well-formed or not. This is a subtask that is similar to the techniques that compilers use to determine if you are missing (or have too many) curly braces or parentheses or brackets. The program should read the user input, and should push an open (when it is encountered, and perform a pop when a closed) is encountered This way, if at the end of the program run, the stack is empty, then the line is well-formed If the end of the input is reached and the stack is not empty, that means there were too many open parentheses, ( If at any time, the program sees a closed parenthesis, ), and the stack is empty already, then an exception will be thrown and this is an indicator that there are too many, or at least a misplaced, closed parenthesis. Either situation should cause the program to indicate it is not well formed An example run might look like the following: ease input a set of parentheses 0(0(0) ->Input is well-formed Another example run might look like the following: ease input a set of parentheses -->Sorry, input is NOT well-formed