We know that B(n) the number of binary search trees containing elements 1,2,…,n equals (2n)!/((n+1)(n!)2). What is the rate of growth of B(n)? Express the leading term, describing the asymptotic growth of B(n), in the form cnban. Provide explicit values of constants c, b and a. Provide a detailed justification of your answer.