This program should be in C language:

There are three types of matched pairs of brackets: [], , and ) A sequence of brackets is considered to be 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 n strings of brackets, determine whether each sequence of brackets is balanced. If a string is balanced, print YES on a new line; otherwise, print NO on a new line. Input Format Take input from a file in1.txt. The first line contains a single integer N, denoting the number of strings. Each line i of the subsequent lines consists of a single string s, denoting a sequence of brackets. Constraints l