Consider the code below: def foo (n): i = 1 while i* i i += 1...

  

Transcribed Image Text:

Consider the code below: def foo (n): i = 1 while i* i i += 1 return i a) What does foo (n) compute, roughly speaking? b) What is the asymptotic time complexity of foo? Consider the code below: def foo (n): i = 1 while i* i i += 1 return i a) What does foo (n) compute, roughly speaking? b) What is the asymptotic time complexity of foo?