Question

Algorithms:

Please explain each step! Thanks!

(20 points) Use the Master Theorem to solve the following recurrence relations. For each recurrence, either give the asympotic solution using the Master Theorem (state which case), or else state the Master Theorem doesn't apply (d) T(n) T() + T (4) + n2

Answer 1

E HAVE T T(2) n2 Tn) THE PREREQU1SITE FOR SOLUINGTHIS MASTER'S THEOREM Maslin ' thiorum Maslir thuorim ) viš dhe the Martin Mthod ar eirict mithod t gutth solulion ricurrinc rululion only works for follerung Th mastir hiorim ype of that con b conurtdtothis amd th tucuvrmc ucur ype is- TIn)a T n uheru a-1 ane b1 thru sls - falloring Thune ari .Zlog, then, T(n)=Cn thim T)=nlogn) )nhurec7 og,a hn T)=OL)

Now here w th gston T T ) n 2 it is notin th ghe of aTf ut wwill mptoticaly comurt th CHbou riavrrinci rilaton to the fatha tyhe of icurremc ulation saluabk ly mas horim Now ecen urit Tlloays bguatn ual to thonor Now aclding T/n/2) and nz bothside uu gut n2 271골)+n2 RHS yT(n)os u Replac Ner w -cen 22) n 7 T n 2T Tn) haru gpation in the Now, oluebh bymestin eueton that thorim

Applying meitir orim on RHs Cnd c-2 So, hure a. Cフ Tn) will gt Heri in this T ( n as we ho Tlry< 272 2 and c=2 thin asymtotially ual to on) Tn) TnOn2 rela bon the rcurrinc ardd T) Also ラ Tビ)2e nり - ond Tn)=o (n2) aned Tl) -Jln2) (1f ond TIn) -lnAns