This question is about time complexity. For each of the given Python functions, state the time complexity in big O notation and provide a brief explanation. (a) def total_func(n): total= 0 for k in range(n): for j in range(n-k, 0, -1): total + k*j return total (b) def fraction_func(n): fraction = 1 for k in range(100): for j in range(k): fraction = k + j + 1/fraction return fraction (C) def another_total_func(n): total= 0 for k in range(n): total += k for k in range(10*n): total += num return total (d) def mid_func(n): low = 0 high = n while low