Recursionmedium
0:00.0

The number of ways to parenthesize an expression of n+1n+1 terms to specify the order of multiplication is given by the Catalan numbers CnC_n. Which of the following is the correct recursive relation for CnC_n for n1n \geq 1 with C0=1C_0 = 1?