Use a Recursion Tree to determine a good asymptotic upper bound on the recurrence T())= T (VA)+T(VA) +0(*) (Choose one: Upload your work in Part 2; For full credit show three levels of the tree, show the sum of the work at each level, and simplification of the work done by the entire tree) 111 4 1 3 2. j 2 3 1500 750 500 4 0 0 0