BM4.2. Example of Induction (Advanced): Balanced Strings
Math Major Basics: Using complete induction, we show that, for balanced strings, the number of left parentheses equals the number of right parentheses. A balanced string is a finite sequence of (s and )s constructed recursively.