Code Bracket Validator

Problem Statement

Code Bracket Validator Problem Description You are given an array of strings, where each string contains only the characters '(', ')', '[', ']', '{', and '}'. For each string, determine if the string is valid. A string is valid if: Every opening bracket has a matching closing bracket of the same type. Brackets close in the correct order. The function isValidBrackets will take one input: string queries[q]: the string queries The function should return an array of strings, where each element is "YES" if the corresponding input string is valid, or "NO" otherwise. To return the string array from the function, you should: Store the size of the array to be returned in the result_count variable. Allocate the array statically or dynamically. The function signature to complete is: char** isValidBrackets(int queries_count, char** queries, int* result_count) { // Complete the function } Examples Example 1: Input: queries = ["{([])}", "([)]", "{[}]", ""] q = 4 Output: YES NO NO YES Explanation: An