What is the T(n) and big O performance of the following function? This function gets a value as an input and prints all prime numbers between 1 and the input number. Math.sgrt takes the square root of a number import math def print alioprimes (n): for num in range (1,n+1): isprime = True for i in range (2, int (1+ math.sqrt(num))): if num o =0 : isprime = False break if isprime: print (num) Which one is faster? sorting a list of size n or to printing all prime numbers up to n ? Answer based on both bubble sort and merge sort. Q5. Assume that that after analysizng a recursive function to find it's T(n) you find that T(n)=1+2T(n/4) What is the big O performance of this function? Is it faster or slower than binay search? Is it faster or slowe than merge sort? Hint: a(logx in base ak)= x(1/k).