Write a Java program which implements a stack for checking whether a parameterized

expression is correctly parenthesized. The program should prompt the user to enter the

parenthesized expression $($You do not have to include arithmetic expression to be evaluated$).$ The

expression entered by the user should then be $($i$)$ displayed with an appropriate message

indication that it is the original expression to be checked, $(2)$ checked, with the appropriate use of

a stack, to determine if the expression is correctly parenthesized $-$ i$.$e$.$ correctly balanced with

matching parentheses, $(3)$ prints an appropriate message indicating whether or not the expression

is correctly parenthesized, and $(4)$ the reason for any expression which is not correctly

parenthesized.

Your program should be tested with a minimum of ten $(10)$ expressions, and a wide range of

various combinations of parentheses $-$ plain, winged, and square parentheses. Your program

must demonstrate the capability of detecting both valid and invalid parenthesized expressions.