A common problem for compilers and text editors is determining whether the parentheses in a string are balanced and properly nested. For example, the string ((())())() contains properly nested pairs of parentheses, which the string )()( and ()) do not. Give an algorithm (in pseudocode) that utilizes a stack to check parentheses balance and returns true if a string contains properly nested and balanced parentheses, and false if otherwise