Prove the Big-O class, Solve the recurrence relation, Solve recurrence relation for the following algorithm, Find order of growth.

11) Prove: n+5 E 0(n2) 12) Solve the following recurrence relation x(n) = x(n) + n for n > 1 x(1) = 1 13) Consider the following algorithm. (a) What is the basic operation? (b) Set up the recurrence relation. (c) Solve the recurrence relation