<p>Running Time Complexity</p><p><img alt="def prime (n): while i*i ?= n: return False else: i=i+1 return True" src="https://media.cheggcdn.com/media%2F936%2F936e72db-61b0-4bd8-b817-880300ed5958%2Fphp4X9c6I.png" style="height:202px;width:300px;" aria-describedby="d3f"/></p><p>Compute running time complexity of prime(n)</p>def prime (n): while i*i ?= n: