3. (a) Draw the recursion treefor T (n) when n = 6 where T(n) T(n/2) +T(n-1) if n s odd and n-3 and T(n) = T(n-1) + T(n-2) 1 if n is even. Assume T(1) = 1 and T(0) 0.