What is the output of the following code:

for i$=2$:$100$

for $j=2$:$100$

if $($~mod$(i,j))$

break; $\%$ if factor found, not prime

end

end

if $)>((\frac{i}{j})$

fprintf $(\text{'}\%$d is prime

$\text{'},$ i$),$

end

end