Problem Statement

Solving a Recurrence by the Master Theorem The recurrence T(n) = 4T(n/2) + n solves to: A. Θ(n²) B. Θ(n log n) C. Θ(n^(log₂ 3)) D. Θ(n² log n)