Complete the body of this function. You do not need to check the precondition. You may use the stack template class. (10 points) bool balanced(const char p[ ], size_t n) // Precondition: p[0]...p[n-1] contains n characters, each of which is '(', ')', '{' or '}'. // Postcondition: The function returns true if the characters form a sequence of correctly balanced parentheses with each '(' matching a ')' and each '{' matching a '}'. Note that a sequence such as ( { ) } is NOT balanced because when we draw lines to match the parentheses to their partners, the lines cross each other. On the other hand, ( { } ) and { ( ) } are both balanced.