Question $4$

$\frac{0}{5}$ points

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?

$3$

$5$ or more

$4$

$1$

$2$