Consider the following function that calculates the factorial of a number:

$//$ Pre: n $>=0$

$//$ Post: returns the factorial of n

int factorial$($int n$)\{$

int result $=1$;

for $($int i $=1$; i $<=$ n; i$++)\{$

result $*=$ i;

$\}$

return result;

$\}$

Is i $<=$ n a valid loop invariant for the for loop?

Question $1$Select one:

True, because it is true before and during each iteration of the loop.

False, because it is not true after the loop terminates.

True, because it is true after the loop terminates.

False, because it is not true at the start of the loop.