Question 3: (2 POINTS: POINT for algorithm2 and one for main) You have found expressions that fail this algorithm. Indeed, an expression well-formed is an expression such as the number of opening and closing parentheses is the same for each type of parentheses. But also, when one reads such expression from left to right and that we encounter a closing parenthesis then its type must be the same as that of the last opening parenthesis encountered which has not yet been treated (associated). You must implement a stack-based algorithm in order to validate expressions: returns true if the expression is well formed and false otherwise. In addition, the analysis should not cycle through the channel only once. You need to create your implementation in the Test class, name this method algorithm2. Here is the algorithm that you must complete: public static boolean algorithm2 (String str) { Stack  myStack; myStack = new ArrayStack  (100); for (int i = 0; i