Balanced Parenthesis Problem. This is to be written in C (NOT C++). I have seen this written in cpp elsewhere but how would you write it in C.

Please utilize a stack interface, split the program into portions stack.c, stack.h, and main.c, and try to avoid using bool if possible. Also, please type the code so I can test/manipulate it as opposed to writing it on a piece of paper and taking a picture of it. The program should be alternatively able to read a text file containing strings instead of inputting them.

You are given a string consisting of parentheses containing (), [], and/or {}.

A string of this type is said to be correct:

(a) if it is the empty string

(b) if A and B are correct, AB is correct

(c) if A is correct, (A), [A], and {A} are correct.

Write a program that takes a sequence of strings of this type and check their correctness. Your program should make no assumptios about maximum string length. Input The file contains a positive integer n for the number of strings to be entered, and a sequence of n strings of parentheses, one string per line. Output a sequence of Yes or No on the output file. Sample Input

3

([])

(([()])))

([()[]()])()

Sample Output

([])

Yes

(([()])))

No

([()[]()])()

Yes