. Specify the best-case and worst-case asymptotic runtime of the following Python functions using big- notation in terms of n, the number of elements in the list of integers vals. Justify your answers in a sentence or two. a. b. def test1 (vals): out = [] for i in range (2, 10): total = 0 for j in range (len (vals)): if vals[j] % i == 0: total += 1 out.append(total) return out def test2 (vals): for ele in vals: for ele2 in vals: if ele+ ele2 == 10: return True for ele3 in vals: for ele4 in vals: if ele3* ele4 == 10: return True return False

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.