Briefly describe an efficient algorithm to test if a string S of parentheses (i.e., "(" and ")" characters) is fully balanced. Such a string is fully balanced if each "(" can be matched to a unique ")" that follows it. For example, "( ((()()))) " is fully balanced and " (())) " is not. What data structure will you use to implement your algorithm? Briefly describe steps to solve this problem with the chosen ADT