Consider the following algorithm.

i $2$

while $($N mod i$)!=0$ do

i $$ i $+1$

Suppose that N is in $\{2,3,4,5,,100\}.$Find the best$-$ and worst$-$case number of $"$N mod i$"$ operations made by this algorithm.