[20 points] Derive T(n) for the following iterative functions and determine Big-O a. def check (n): if n%2==0 : return False i=3 ul math. sqrt (n) while i if if n%i==0: return False i+=2 return True b. def f1 (array): for i in range ( len ( array )): item = array [i] destination =1 while destination >0 and array[destination 1]> item: array [destination] = array [destination 1] destination =1 array[destination] = item