Find a recurrence relation for Cn , the number of ways to parenthesize the product of n+1 numbers, x0· x1 · x2 ... xn, to specify the order of multiplication. For example, C3: = 5 because there are five ways to parentheize x0 · x1 · x2 ..... xn to determine the order of multiplication: ((x0.x1).x2) • X3 , (x0. (x1 · x2)). • x3, (x0 • x1) . (x2 • x3), x0. ((x1. x2). x3), x0 · (x1 · x2 · x3))