For this Question: Morgan Stark asks Peter for help in her HW. She is given an integer n representing the number of pairs of squiggly brackets. Her task is to find the number of all combinations of well- formed(balanced) squiggly brackets.The input contains only a single integer denoting the value of n.

<b>Constraints:-</b>
0 &le; n &le; 7Print the number of squiggly brackets.Sample Input:-
1

Sample Output:-
1

Explanation:-
{}

Sample Input:-
2

Sample Output:-
2

Explanation:-
{}{}
{{}}, I have written this Solution Code: #include<bits/stdc++.h>
#define MAX_SIZE 100
using namespace std;
int cnt=0;
void _printParenthesis(int pos, int n,int open, int close)
{
    static char str[MAX_SIZE];
    if(close == n)
    {cnt++;
        return;
    }
    else
    {
        if(open > close)
        {
            str[pos] = '}';
            _printParenthesis(pos + 1, n, open,
                            close + 1);
        }
        if(open < n)
        {
            str[pos] = '{';
            _printParenthesis(pos + 1, n,
                             open + 1, close);
        }
    }
}
// Wrapper over _printParenthesis()
void printParenthesis(int n)
{
    if(n > 0)
        _printParenthesis(0, n, 0, 0);
cout<<cnt;
    return;
}
// Driver code
int main()
{

//     freopen("output.txt", "w", stdout);
    int n ;
cin>>n;
    printParenthesis(n);
    return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?