hi, i was going through java exercise and i did not understand this exercise. if you know anything, please post your comment here.

Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). What is the maximum number of parentheses that will ever appear on the stack AT ONE TIME during the computation? A. 1 B. 2 C. 3 D. 4 E. 5 or more

This doesn't even look like a Java exercise. Algorithms are typically described in a language independent way. So do you know what "the usual algorithm for determining whether a sequence of parentheses is balanced" means? Do you have a guess at what the answer is? Better yet, can you justify your guess?

You need to make an attempt then I will be glad to provide feedback on what you think the right answer is.

First, you need to fix your display name, as you've been asked to do in the past. Real-sounding first and last name, here. Thanks. Otherwise, I'll have to close your account.