If I could get some help, that would be swell. Thanks.

def f ibl (n): if n=: return 0 if n=1: return 1 else: return fibl( n1)+fib1(n2) Iterative fibonacci(n) return for i=2 through n do Q6. What is O(?) above? (exactly) Q5. What is O(?) above? for i in range (1,n) for j in range (1,m) (roughly) for k in range (1,n) O(1) operation Q7. What is O(?) above, in terms of n and m ? Q8. What if you replace range of k to (1,100)