Correct, well explained answers will be given a THUMBS UP!

4. (30pt pts.) Solving recurrences Solve the following recurrence relations and give a bound for each of them. Do not use the Master Theorem. You must use the recursion tree method. For each recurrence, make sure you state the branching factor, the height of the tree, the size of the subproblems at depth k, and the number of subproblems at depth k. It is not necessary to draw the tree, though you may do so anyway to help yourself visualize the problem. (a) T(n) = 2T (n/2) + Vn (b) T(n) = 2T (n/3)+1 (c) T(n) = 5T (n/4)+n (d) T(n) = 7T (n/7)+n (e) T(n) = 9T (n/3) +n2