6. Stacks (15 points) A bracket is considered to be any one of the following characters: 6) ). Lor Two brackets are considered to be a matched pair if the an opening bracket (1.0., Lor() occurs to the left of a closing bracket (i...). ), or ) of the exact same type. There are three types of matched pairs of brackets:0, 0, and (). A matching pair of brackets is not balanced if the set of brackets it encloses are not matched. For example, ((()) is not balanced because the contents in between (and) are not balanced. The pair of square brackets encloses a single, unbalanced opening bracket, and the pair of parentheses encloses a single, unbalanced closing square bracket). By this logic, we say a sequence of brackets is balanced if the following conditions are met: It contains no unmatched brackets. The subset of brackets enclosed within the confines of a matched pair of brackets is also a matched pair of brackets. Given strings of brackets, determine whether each sequence of brackets is balanced. If a string is balanced, return TRUE. Otherwise, return FALSE. e function prototype is given as the following: bool isBalanced (strings); You can follow the pseudo-code below: Make an empty stack For each character ins If the character is an opening symbol, push it onto stack If it is a closing symbol If the stack is empty return false else if the symbol at the top of stack is not the corresponding opening symbol return false pop the stack End For If the stack is not empty return false return true