3.For a 2-3-4 tree of height 5, let x be the minimum possible size, y be the maximum possible size, then (xy) mod 5 is (A)0 (B)1 (C)2 (D)3 (E) 4

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)?