Consider the following functions. (Note: you do not need to know anything about function foo to answer the questions below.) def q1ab(n): result = 0 i = n for i in range(n): for j in range(n): result = result + (i * foo(j) * foo(i+j)) return result If function q1ab(10000) requires 2 seconds to execute, approximately how long will qlab(20000) take? Give a tight Big-O running time bound for q1ab. I.e. q1ab(n) = O(?) def q1cd(n): result = 1 i = 1 while i