Find the cost function of the following algorithm and express the upper bound of the time complexity in asymptotic notation. $(2$ marks$)$

a$.$ sum $=0$;

for $i=0$ to $i=n$ do

for $j=0$ to $j=i^2$ do

if jmodi$==0$ then

sum $=$ sum $+1$ ;