Qucstien 1 Find the erder of growth for solations of the following recurrences using Masters theorem. aT(n)=6T(nn)+n2 bT(n)=3T(2m)+n Qucstion 2 For each of the follewing pairs of functions, indicate whether the first function of each of the following pairs has a lower, same, of higher order of growth (to within a coastant multiple) than the second function. a. n(n+1) asat 2000a2 b. 2t-3 and? Duestion 3 Use the informal definitions of 0,, and n to determine whether the following assertions are true or false. Explain. a. n(n+1)/2co(n2) b. b. a(a+1)/2eo(n2) Quzstion 4 Consider the following recursive algorithm for computing the asm of the nret n euber: 5(n)=t3+23++n2 Algorithm s(n) R/input: A poeisive integer n //Output The wum ot the finet n eutee: if n=1 return 1 else return S(n1)+nnn a. Set yp and thetve a perupresce relation for the namber at times the algotikhm't basie operation la esneculed. h. How doen this alporistum cempare with the wtraighngorward nenrecunse algorithm for eemputieg this nanetion