Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recursionmedium
0:00.0

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