The following function adds all of the pairwise products of two lists, list1 and list2, and then returns the result. The size of each list is n.

Is there an asymptotic upper bound in the algorithm? If so, what is it and explain. If not, explain the reason.

Is there an asymptotic lower bound in the algorithm? If so, what is it and explain. If not, explain the reason.

Is there an asymptotic tight bound in the algorithm? If so, what is it and explain. If not, explain the reason.

def calculate(list1, list2): result = for i in range(len(list1)): for j in range(len(list2)): result += list1 [i]list2[j] return result