Question $2$: Identifying a function's time and space efficiency

An $Al$ assistant was asked the following:

"Please create a pseudocode function that can check if a given number $n$ is prime or not, where $n>1."$

The assistant returned the three following functions:

$\backslash$table$[[$Function A$,$Function B$,$Function C$],[\backslash$table$[[$function isPrime$($number $n)],[$for i from $2$ to square root of $n$ rounded$],[$down inclusive$],[$if $n$ mod $i$ is $0],[$return false$],[$return true$]],\backslash$table$[[$function isPrime$($number $n$