1.

Using the Master method, solve the following recurrence relation:

T (n) = 4 T(n/2) + 5 * (n^2)

Group of answer choices

T(n) = (n^2 log n)

T(n) = (n^2)

T(n) = (n)

T(n) = (n log n)

Using the Master method, solve the following recurrence relation: T (n) = 4 Tn/2) + 5* (n^2) T(n) = (n^2 log n) O T(n) = 0 (n^2) O T(n) = 0 (n) O T(n) = (n log n)