Problem la: Show that 12 + 22 + ... + n2 is O(ny) Solution: Problem 1b: Given f(n) = 1+2+3+ ... +n and g(n) = n3. Is f(n) 2(g(n))? Solution: Problem le: Show that the sum of the first n positive odd integers is (n) Solution: Problem Id: What is the time complexity for the following loop? for i in range(n): for j in range(n): k=k+111 Solution: Problem le: What is the time complexity for the following loop? for i in range(n): # let n=4, i=0,1,2,3 for j in range(i): #i=1, j=0. i=2, j=0,1. i=3,j=0,1,2 k=k+123 Solution