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(lst)) 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 large_prefix(lst, t):

n = len(lst)

i = len(lst)-1

while i > 0:

if t > lst[i]:

return i

i -= 1

return None