State a good candidate for loop invariant. No proof required. Function to check if a number is prime boolean isPrime$($int n$)$ Check numbers from $2$ to the square root of n for $($int i $=2$ ; Math.sqrt$($n$)$; $)$ If is divisible by $,$ it's not prime if $($ xi$==0)$ return false; If no divisor is found, is prime return true