Could you please help me with solving the problem following the instructions. This is in Python thanks.

1. Find the worst case running time in terms of the input n, using Big Oh notation, for each of the algorithms below. Briefly explain your answers. For function A, n is the input number; for B, n is the length of the input list, and for C, n is the length of the input strings, which you can assume are the same length. (a) def function(n): total = 0 for i in range(n): for j in range (2*n+3): for k in range(n // 2): total = total +1 return total (b) def functionB(inputlist): outputlist - n = len (inputlist) while len(inputlist) > n//3: outputlist.append(inputlist.pop(0)) return outputlist (c) def function(word, word2): listi = list (word) list2 = list (word) for item in liati: if item in list2: list2.remove(item) else: return false return True