Determine the tightest simple bound of the worst-case computational complexity of the following function in terms of the size of the input list (n=len(1st)) and justify your answer. For that, describe what situation constitutes the worst case and what line(s) is/are dominating the overall computational cost. Provide additional arguments as necessary (you should not need more than 3-4 sentences). def sublist_of_sum (1st, 3): Input : list 1st, and number 3 Output: sublist of 1st of sum 3 (or None if no such sublist exists) n = len (1st) for i in range (n): for j in range (i, n): if sum (1st[i:j+1])==3: return lst[i:j+1] return None