5. Consider a binary heap that results from suc successively inserting keys 6, 3, 7, 8, 5, 1,2, 4, 9 into an initially empty heap. Then the depth of key 5 is (A)0 (B) 1 (C)2 (D)3 (E) None of above

Please choose the best possible answer in each of the following questions. In questions that ask for time complexities, please choose the tightest bound. 1. Consider the following five recursive functions: (A)(B) (C)(D)(E) Which recursion yields the highest asymptotic complexity for T(n)?