Let f(n) denote the expected running time of a code the worst-case. Prove that there exists a constant c such that

And Prove that f(n) = O(n).

If n = 1 n- C n n/2