Consider the following recurrence: t(1) = 0 (1) t(2) = 1 (2) t(n) = t(⌈n/3⌉) t(⌈2n/3⌉) 1 if n > 2 (3) you will use the substitution method (i.e., induction) to find a θ bound for t(n)
1. Warmup. For this part, ignore the base cases and also do not worry about the ceilings in (3).