If $T(n)$ denote the number of times the for loop is executed by the program on input $n,$ then what

will be the recurrence relation for the following code segment?

int IsPrime $(n)$

$\{$

int $i,n$;

for$(i=2$;$i\sqrt[\phantom{2}]{n}$;$i++$

$\{$

if $(n\%i==0)$

prinrf$("$Not prime $\frac{?}{?}$

$"$;

return $0$ ;

$\}$

return $1$;

$\}.$