Question

Any help on number 2 would be greatly appreciated. Thanks!

Give asymptotic upper bounds (i.e.. in O notation) for T(N) in each of the following recurrences. Assume that T(N) is constant for sufficiently small N. Make you bounds as tight as possible and justify your answers

Answer 1

For simplicity aissume n 2 Feb 6, 2017

→ We guss an upper bound 0,2-b/ohne b is some consta We voill gemenole a set conslamts on k amd b and i b tusns oul to be unnecesscry, we wil be cble to sel to whalevey we wam a thhu enel Comstcmd b This logically implies that Tin) isOG") which čam be veribied vorth sespect +o Inductive case. wie assume our property is tsuw,or n- Now show thot /it is rue bor n This is tu ao lone as b>so we endup uorth two conshsaints that need tobe Satisbied bor this prool to loork Let b This is al woys possible ar thu deb o, O, allovws wo to choose emy comsjom imihicon We have proved thod our properly