complexity of recurrence relation

Introduction : In this question, we will apply master theorem to show T(n)=2T(n/2)+n^2 is theta(n^2). Master theorem finds an upper bound for some recurrence relations if some conditions on parameters…