Let the function t(n) be defined recursively by: t(1) = 1 t(n) = 3 t(n/2) + n + 1 for n a power of two greater than 1. Draw the recursion tree up through level 3, remembering that the root is at level 0 and has value n + 1. What is the sum of the values of the nodes at level 3, assuming that n greaterthanorequalto 16? Select one: a. (27/8)n + 27 b. (81/8)n + 81 C. (9/4)n + 9 d. 27n + 27