Question

T(n)=2T(n/2)+nlogn with master theorm

Answer 1

Answer:

It is a straight up application of master theorem: T(n) = 2 T(n/2) + n log^k(n). Or, if MT is not of interest, you can just do recursion tree unfolding and do the math that way.

Explanation:

please mark me as brainliest