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: import java.io.*;
import java.util.*;



class Main {


    public static void main (String[] args)throws IOException {

                      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
                      int n = Integer.parseInt(br.readLine());
                     System.out.print(brackets(n));
    }
    public static int brackets (int n){
        int ans = 0;
        if(n<=1){
            return 1;
        }
        for(int i=0;i<n;i++){
            ans+= brackets(i) * brackets(n-i-1);
        }
        return ans;
    }

}, In this Programming Language: Java, Now tell me if this Code is compilable or not?