PLEASE ANSWER AS SOON AS POSSIBLE. I WILL UP VOTE.

Algorithm Analysis

Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 2T [(1/2)]) + n Do not draw the tree, describe it by height, cost of each node, number of nodes at ith level etc Determine the value of big o from these numbers. Use the substitution method to verify your