Select the best answer. We plan to use the Master Theorem to solve this recurrence relation: Tin) - 3Tn/2)+ n2. Using the Master theorem below, select the solution for the above recurrence relation. a, ( log n) be (nlog n) c.e(n2) d.(n) Theorem 4.1 (Master theorem) Let a 2 1 and b 1 be constants, let f(n) be a function, and let T(n) be defined on the nonnegative integers by the recurrence T(n) = aT(n/ b) + f(n) . where we interpret n/b to mean either In/bj or In/bl. Then T (n) has the follow- ing asymptotic bounds: 1. If f(n) = 0(nlogba*) for some constante > O, then T(n) = (nlogba). 2. If f(n) (nlogh4), then Tn) (sIg n). 3. If f(n)2(ot) for some constant e > 0, and if af (n/b) s cf(n) for some constant c 0, then T(n)(no4). 2. If f(n)o), then T(n) oIg n. 3. If f(n) (nlogba+*) for some constant e > 0, and if af(n/b) cf(n) some constant c 0, then T(n)() 2. If f(n)(nogh), then T(n) ( Ig n). 3. If f(n-(nlogba+e) for some constant > 0, and if af(n/b) cf(n) for some constant c