Data Structure by Java . help me quickly please ..

Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (0030))? (1 Point) None of the above 4 3 2 1 2 2 After executing the following code, the output will be: Stack S1 = new Stack() Stack S2=new Stack(); Int y=1; For (int i=5; i>2; i--) { 51.push(y+i); S2.push(y*i); Y+= 2; } For(int j=3;j> 1j--) S1.push(S2.pop()); 51.print(); * (2 points) 15 12 8 76 None of the above 876 12 15 6 7 8 15 12 12 15 8 76