Hi, I was asked to calculate the time complexity of the following question, please help.

new = copy.deepcopy(f1) boo = False for j in range(len(f2)): boo = False for k in range(len(new)): if new[k][] f2[j][@]: boo = True if new[k][1] is not None and new[k][2] is not None and (new[k][1] != f2[j][1] or new[k][2] != f2[j][2]): return None if new[k][1] is None: new[k][1] f2[j][1] if new[k][2] is None: new[k][2] = f2[j][2] if not boo: new.append(f2[j]) return sorted(new)