What is time complexity (give asymptotic analysis of running time using Big-O)

def function1(n): count = 0 for i in range(n//2,n+1): for j in range(1,n//2+1): for k in range (1, n+1): count += 1 k *= 2 return count

def function2(n): sum = 0 for i in range(n): for j in range(i*i): sum+=1 return sum