Question $3$: Matching Parentheses $(30\%)$

You are going to write a program to check whether the parentheses are balanced or not. For

example, $(())()$ is a balanced parenthese, while $(())($ and $(()))$ are

unbalanced. There are three types of parentheses, which are $(),[]$ and $\{\}.$ If the

parentheses are balanced, you need to output the number of matching parentheses. If the

parentheses are unbalanced, you need to output the first position $($zero$-$based$)$ that you spot

an error.

Your program should read the input from the file, and output the answer to another file. The

first argument is the input file name, while the second argument is the output file name.

Name your program as $$lab$3-$q$3.$c$.$

Input file: A string contains $(),[]$ and $\{\}$ only. The length of input will not exceed $100$

characters.

Output file: If the parentheses are balanced, output $$There are X balanced

parentheses.$$ If the parentheses are unbalanced, output $$Error is spot at position

Y at first.$$ Y is a zero$-$based number. For the Sample $2$ below, the error occurs at the

position of $\backslash 0.$

Sample $1$ Input:

$(())()$

Sample $1$ Output:

There are $3$ balanced parentheses.

Sample $2$ Input:

$(())($

Sample $2$ Output:

Error is spot at position $5$ at first.

Sample $3$ Input:

$([)]$

Sample $3$ Output:

Error is spot at position $2$ at first.