7. ( 6 pts) State the running time of the following functions in Big O notation in terms of n, the size of the data structure given to the function (a) Assume n is an int def populateList (n) : alist =[] for i in range (n) : alist. append (i) return alist (b) Assume myList is a list and i,j are integers def getLargervalue (mylist, i,j) : ans =0 if my 1 st [i]> mylist [j] : else: ans - mylist [1] return ans (c) Assume d is a dictionary that maps strings to numbers def getLargervalue (d,i,j) : ans =0 if d[1]>d[j]: else: ans=d[i]returnans=d[j] 6. ( 10 pts) What is the Big-O running time of the following code snippets in terms of n ? (a) x=0foriinrange(n):x=x+iforiinrange(n):x=x+i (b) x=0 for i in range (100n) : x=x+1 (c) x=0 for i in range (n) : for j in range (200) : (d) i=0 x=x+i+j while i1:i=i/2<>