# Question: draw recursion trees for t and s which are defined...

###### Question details

draw recursion trees for T and S which are defined as below

T(n) ={ T(n/3) + T(n/2) + n ...If n>= 6 and T( n) = 1 , otherwise.

and S(n) = {S(5n/6) + n if n>=6 and S(n) = 1 otherwise.

What are the big-O bounds we get on solutions to the recurences ? Then use the recursion tree to argue that for all n, T(n) <= S (n)