Please provide the time complexity for the functions provided:

def bigo (n) : for h in range (0,100,n) print(h) def bigo (n): for h in range (0,n) : j=1 while j<:>