Let the function t(n) be defined recursively by: t(1) = 1 and t(n) = 3t(n/2) +n + 1 for n a power of two greater than 1. How many children will each internal node of the recursion tree have? O (a) 1 (b) 2 (c) 3 (d) 4 (e) 3/2