Use recursion trees to solve the following recurrences. you may assume that t(1) = o(1). (a) t(n) = 3t(n/3) n (b) t(n) = 2t(n/3) n (c) [optional] t(n) = 4t(n/3) n