Find the worst case runtime (big-O notation) for the following pseudo code which returns true if an integer n is prime, false if it is not prime. Write the comparison made that the big-O bounds. For example, if 3n+1 comparisons are made, then the answer is O(n), but 3n+1 must be included in the answer.

procedure isPrime(n)

if n <= 1

return false

else if n <= 3

return true

else

for i in 2 to sqrt(n)

if n % i == 0

return false

return true