DESIGN AND ANALYSIS OF ALGORITHM:

Prove the following asymptotic bounds. a) 60n2+5n+1O(n2) b) 1+2++n(n2) c) 2n+3lgn(n) d) lg3nO(n0.5)

Prove the following asymptotic bounds. a) c) 60n2 e 0(n2) 1+2 E Q(n2) 2n 3 Ig n O(n)