Given n pairs of parentheses. Write a program to print out all valid configurations. For example n=2, ()(), (()) are valid, but ))((, ())( are not. fo

Given n pairs of parentheses. Write a program to print out all valid configurations.
For example n=2, ()(), (()) are valid, but ))((, ())( are not.
foo(stack s, int count, int len)
{
if(count<0)
return false;
if(len==0)
{
if(count==0)
return true;
else return false;
}
char top=s.top();
s.pop();
if (top==’(’)
return foo(s,count++,len--);
else if(top==’)’) return foo(s,count--,len--);
else return foo(s,count,len--);
}