Consider an input string of size n: $($i$)$ what is the worst$-$case time that your

algorithm takes to decide whether or not the string is correct $($balanced$)$ or incorrect

$($unbalanced$)?($ii$)$ Why? Give your answers in terms of the O$-$notation.